Sciweavers

3396 search results - page 179 / 680
» Tree representations of graphs
Sort
View
ORL
2008
91views more  ORL 2008»
13 years 9 months ago
On the integrality ratio for tree augmentation
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...
Joseph Cheriyan, Howard J. Karloff, Rohit Khandeka...
IPPS
1995
IEEE
14 years 21 days ago
Performance evaluation of a new parallel preconditioner
The linear systems associated with large, sparse, symmetric, positive deļ¬nite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
Keith D. Gremban, Gary L. Miller, Marco Zagha
FOGA
2007
13 years 10 months ago
Saddles and Barrier in Landscapes of Generalized Search Operators
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes deļ...
Christoph Flamm, Ivo L. Hofacker, Bärbel M. R...
ECCC
2010
92views more  ECCC 2010»
13 years 7 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaenderā€™s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau
ISBRA
2009
Springer
14 years 3 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology ā€“ to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...