3396 search results - page 252 / 680 » Tree representations of graphs |
JPDC
2006
13 years 9 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
EOR
2002
13 years 9 months ago
2002
Decision trees allow the modeling of event-dependent reasoning, but do not consider the dynamics of contextual changes in reasoning. In the framework of the SART project, which ai...
CPC
1998
13 years 9 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
APPROX
2004
Springer
14 years 3 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...