找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: 类属
发表于 2025-3-23 12:13:58 | 显示全部楼层
发表于 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
发表于 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
发表于 2025-3-24 01:17:35 | 显示全部楼层
发表于 2025-3-24 06:12:55 | 显示全部楼层
发表于 2025-3-24 07:00:19 | 显示全部楼层
发表于 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
发表于 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
发表于 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
发表于 2025-3-24 23:51:22 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153122.jpg
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-11 13:26
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表