1447 search results - page 125 / 290 » Graphs and Path Equilibria |
168
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
144
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
135
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
155
click to vote
CORR
2000
Springer
15 years 4 months ago
2000
Springer
The multidimensional, heterogeneous, and temporal nature of speech databases raises interesting challenges for representation and query. Recently, annotation graphs have been prop...
143
click to vote
DM
1999
15 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...