Sciweavers

2487 search results - page 42 / 498
» Partitions of Graphs into Trees
Sort
View
OL
2010
140views more  OL 2010»
13 years 4 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
CCCG
2006
13 years 10 months ago
Geometric Separator for d-Dimensional Ball Graphs
We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....
Kebin Wang, Shang-Hua Teng
EJC
2008
13 years 9 months ago
Locally constrained graph homomorphisms and equitable partitions
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
Jirí Fiala, Daniël Paulusma, Jan Arne ...
WG
2004
Springer
14 years 2 months ago
Collective Tree Spanners and Routing in AT-free Related Graphs
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
PADS
2004
ACM
14 years 2 months ago
Exploiting Symmetry for Partitioning Models in Parallel Discrete Event Simulation
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
Jan Lemeire, Bart Smets, Philippe Cara, Erik F. Di...