2487 search results - page 196 / 498 » Partitions of Graphs into Trees |
136
click to vote
IPPS
1995
IEEE
15 years 7 months ago
1995
IEEE
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...
115
click to vote
FOGA
2007
15 years 5 months ago
2007
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ļ...
146
click to vote
ECCC
2010
15 years 2 months ago
2010
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...
159
click to vote
ISBRA
2009
Springer
15 years 10 months ago
2009
Springer
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...
133
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...