422 search results - page 41 / 85 » Shortest paths between shortest paths and independent sets |
ICC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— Underlay topology information is important to construct efficient overlay networks. To achieve end-to-end network topology inference among a group of hosts, traceroute...
TCS
2010
13 years 7 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...
SSDBM
2005
IEEE
14 years 2 months ago
2005
IEEE
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...