1729 search results - page 60 / 346 » On Bounds for the k-Partitioning of Graphs |
WG
2004
Springer
15 years 3 months ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
WDAG
2000
Springer
15 years 1 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
ARSCOM
2008
14 years 10 months ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
JDA
2006
14 years 10 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
APPROX
2010
Springer
14 years 10 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...