Sciweavers

1545 search results - page 76 / 309
» On tree congestion of graphs
Sort
View
STACS
2009
Springer
15 years 4 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
15 years 1 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
CONSTRAINTS
1998
120views more  CONSTRAINTS 1998»
14 years 9 months ago
Constrained Graph Layout
Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model...
Weiqing He, Kim Marriott
HYBRID
2009
Springer
15 years 4 months ago
Distributed Tree Rearrangements for Reachability and Robust Connectivity
This paper studies connectivity maintenance in robotic networks. We propose a distributed coordination algorithm that can be combined with the individual motion control strategies ...
Michael Schuresko, Jorge Cortés
CVPR
2008
IEEE
15 years 4 months ago
Normalized tree partitioning for image segmentation
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...
Jingdong Wang, Yangqing Jia, Xian-Sheng Hua, Chang...