162 search results - page 19 / 33 » The Induced Disjoint Paths Problem |
WG
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
INFOCOM
2002
IEEE
14 years 16 days ago
2002
IEEE
Abstract-- We propose a framework for decentralized path selection and on-demand wavelength channel provisioning in WDM networks with routing constraints. Within this framework, th...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
TON
2010
13 years 6 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
DM
2007
13 years 7 months ago
2007
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...