找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Algorithms and Computation; 16th International S Xiaotie Deng,Ding-Zhu Du Conference proceedings 2005 Springer-Verlag Berlin Heidelberg 200

[復(fù)制鏈接]
樓主: 類(lèi)屬
11#
發(fā)表于 2025-3-23 12:13:58 | 只看該作者
12#
發(fā)表于 2025-3-23 14:55:23 | 只看該作者
Simultaneous Matchingsatching problem, which has applications in constraint programming: Given a bipartite graph as above and a collection . of . subsets of ., find a subset .???. of the edges such that for each ., the edge set . ∩ (.× .) is a .-perfect matching in . (or report that no such set exists). We show that the
13#
發(fā)表于 2025-3-23 18:26:46 | 只看該作者
An Optimization Problem Related to VoD Broadcastingresents a schedule in which each page assigned to a leaf under node . (1≤ . ≤ .) appears with period ... By varying ., we want to maximize the total number . = ... of pages assigned to the leaves with the following constraints: for 1≤ .≤ ., ., where . is a given integer parameter. This problem arise
14#
發(fā)表于 2025-3-24 01:17:35 | 只看該作者
15#
發(fā)表于 2025-3-24 06:12:55 | 只看該作者
16#
發(fā)表于 2025-3-24 07:00:19 | 只看該作者
17#
發(fā)表于 2025-3-24 13:37:45 | 只看該作者
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphsl minimal edge sets .???. such that every vertex pair (.,.) ∈ . is disconnected in ., generalizing well-known efficient algorithms for enumerating all minimal .-. cuts, for a given pair .,. ∈ . of vertices. We also present an incremental polynomial time algorithm for enumerating all minimal subsets
18#
發(fā)表于 2025-3-24 17:10:02 | 只看該作者
Orthogonal Drawings of Series-Parallel Graphs with Minimum Bendsine segments, and any two edges do not cross except at their common end. A bend is a point where an edge changes its direction. A drawing of . is called an optimal orthogonal drawing if the number of bends is minimum among all orthogonal drawings of .. In this paper we give an algorithm to find an o
19#
發(fā)表于 2025-3-24 19:16:19 | 只看該作者
Bisecting a Four-Connected Graph with Three Resource Setswhere |..| is even for each .. The partition problem with . resource sets asks to find a partition .. and .. of the node set . such that the graphs induced by .. and .. are both connected and |.. ∩ ..|=|.. ∩ ..|=|..|/2 holds for each .=1,2,...,.. The problem of testing whether such a bisection exist
20#
發(fā)表于 2025-3-24 23:51:22 | 只看該作者
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153122.jpg
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-17 07:58
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
溧阳市| 安乡县| 邻水| 新巴尔虎左旗| 成安县| 青岛市| 铜山县| 资阳市| 金华市| 东城区| 高青县| 临沭县| 武鸣县| 星座| 洛扎县| 多伦县| 龙川县| 洛扎县| 布尔津县| 泾阳县| 白城市| 灌云县| 栖霞市| 蓬莱市| 宁波市| 大石桥市| 灵丘县| 赣榆县| 乌审旗| 岚皋县| 香港| 蛟河市| 和龙市| 宁蒗| 高邑县| 仙桃市| 昌平区| 金阳县| 无为县| 大理市| 抚松县|