1172 search results - page 69 / 235 » Path Algorithms on Regular Graphs |
127
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
88
Voted
SIAMDM
2008
15 years 11 days ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
112
click to vote
ICPP
2009
IEEE
15 years 7 months ago
2009
IEEE
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
108
Voted
VR
2007
IEEE
15 years 6 months ago
2007
IEEE
We present a novel approach for real-time path planning of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multi-agent Navigation Graph (MaNG...
80
Voted
ICIAP
2003
ACM
16 years 17 days ago
2003
ACM
A novel approach is presented to select multiple key frames within an isolated video shot where there is camera motion causing significant scene change. This is achieved by determ...