88 search results - page 4 / 18 » Cycle Covering |
SIAMDM
2010
15 years 5 days ago
2010
151
click to vote
FOCS
2003
IEEE
15 years 7 months 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 ...
113
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
132
click to vote
NETWORKS
2007
15 years 1 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...
130
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...