202 search results - page 7 / 41 » Cycle Cover with Short Cycles |
COMPSAC
2001
IEEE
13 years 11 months ago
2001
IEEE
In this short paper, we present the outline of a process for developing design products. The advantage of having a process for these types of projects is that it allows us to focu...
FOCS
2003
IEEE
14 years 25 days ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
DM
2007
13 years 7 months ago
2007
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
NETWORKS
2007
13 years 7 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
SPAA
1993
ACM
13 years 11 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...