111 search results - page 10 / 23 » The Hamiltonian p-Median Problem |
126
click to vote
COMSWARE
2007
IEEE
15 years 7 months ago
2007
IEEE
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
104
Voted
DM
1999
15 years 11 days ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
109
click to vote
JSAT
2008
15 years 20 days ago
2008
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
110
click to vote
SPAA
1993
ACM
15 years 4 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
81
Voted
ENDM
2007
15 years 20 days ago
2007
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...