313 search results - page 35 / 63 » Shortest Paths in Distance-regular Graphs |
SIGECOM
2003
ACM
14 years 24 days ago
2003
ACM
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
SWAT
1998
Springer
13 years 11 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
TCS
2010
13 years 6 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...
ICPP
2006
IEEE
14 years 1 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
INFOCOM
2003
IEEE
14 years 25 days ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...