找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

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

[復制鏈接]
樓主: 類屬
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
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2026-1-19 22:24
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
桦川县| 固镇县| 祁东县| 靖边县| 师宗县| 如东县| 洞口县| 弥勒县| 郎溪县| 大同县| 溧水县| 泰安市| 合江县| 黔西| 湄潭县| 新乡县| 读书| 洞头县| 黑龙江省| 乌审旗| 鄱阳县| 江川县| 密山市| 津南区| 通河县| 南丰县| 大埔县| 绿春县| 长宁县| 施秉县| 陇西县| 宁阳县| 宿迁市| 讷河市| 泽普县| 时尚| 温泉县| 昭苏县| 泰州市| 博爱县| 青川县|