6 search results - page 1 / 2 » The Longest Minimum-Weight Path in a Complete Graph |
CPC
2010
13 years 4 months ago
2010
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
IPL
2007
13 years 4 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
DM
1999
13 years 4 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
CVPR
2010
IEEE
13 years 5 months ago
2010
IEEE
We present a novel approach for robust localization of multiple people observed using multiple cameras. We use this location information to generate sports visualizations, which i...