1545 search results - page 143 / 309 » On tree congestion of graphs |
ISBI
2004
IEEE
15 years 10 months ago
2004
IEEE
We present a general framework for image discrimination based on identifying small, localized differences between images. Our novel matching scheme is based on an alternate inform...
WG
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
JPDC
2006
14 years 10 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
14 years 10 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...
76
Voted
CPC
1998
14 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, ...