1545 search results - page 49 / 309 » On tree congestion of graphs |
204
Voted
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
193
click to vote
ENDM
2010
15 years 6 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
157
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
If G = Kn is the complete graph, the classical Pr
160
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
184
click to vote
ICALP
2004
Springer
16 years 3 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...