313 search results - page 32 / 63 » Shortest Paths in Distance-regular Graphs |
114
click to vote
SIAMCOMP
2000
15 years 7 days ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
93
Voted
ORL
2008
15 years 13 days ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
107
Voted
CCR
1998
15 years 5 days ago
1998
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
CORR
2010
Springer
15 years 17 days ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...
119
Voted
SODA
2008
ACM
15 years 1 months ago
2008
ACM
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...