2487 search results - page 214 / 498 » Partitions of Graphs into Trees |
158
click to vote
ECAL
2003
Springer
15 years 12 months ago
2003
Springer
We present a general method for evaluating and visualizing evolutionary dynamics of self-replicators using a graph-based representation for genealogy. Through a transformation from...
150
click to vote
EOR
2010
15 years 6 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
178
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
194
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
179
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...