Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,612,595 papers from all fields of science
Search
Sign In
Create Free Account
Edge cycle cover
Known as:
Cycle cover
In mathematics, an edge cycle cover (sometimes called simply cycle cover) of a graph is a set of cycles which are subgraphs of G and contain all…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Bridge (graph theory)
Cycle (graph theory)
Graph (discrete mathematics)
Planar graph
Expand
Broader (1)
Combinatorial optimization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours
I. Parberry
arXiv.org
2020
Corpus ID: 210714242
New algorithms for generating closed knight's tours are obtained by generating a vertex-disjoint cycle cover of the knight's…
Expand
2019
2019
ALLSAT compressed with wildcards: All, or all maximum independent sets.
M. Wild
2019
Corpus ID: 167217394
An odd cycle cover is a vertex set whose removal makes a graph bipartite. We show that if a $k$-element odd cycle cover of a…
Expand
2017
2017
Designing Network Monitoring Schemes Based on Segment Routing
Xiaoqian Li
,
K. Yeung
Global Communications Conference
2017
Corpus ID: 30813783
Network monitoring is important to guarantee the reliable end-to-end communications. Segment routing can be used to reduce…
Expand
2017
2017
Cover and Conquer: Augmenting Decompositions for Connectivity Problems
A. Haddadan
,
Alantha Newman
,
R. Ravi
arXiv.org
2017
Corpus ID: 125210922
We explore and introduce tools to design algorithms with improved approximation guarantees for edge connectivity problems such as…
Expand
2012
2012
Minimum Spanning Trees, Perfect Matchings and Cycle Covers Over Stochastic Points in Metric Spaces
Lingxiao Huang
,
J. Li
arXiv.org
2012
Corpus ID: 41670242
We consider the stochastic graph model where the location of each vertex is a random point in a given metric space. We study the…
Expand
2012
2012
N ov 2 01 2 Minimum Spanning Trees , Perfect Matchings and Cycle Covers Over Stochastic Points in Metric Spaces
Lingxiao Huang
,
J. Li
2012
Corpus ID: 3066910
We consider the stochastic graph model where the location of each vertex is a random point in a given metric space. We study the…
Expand
2006
2006
Approximability of Minimum-weight Cycle Covers
B. Manthey
2006
Corpus ID: 125593372
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle…
Expand
2005
2005
Logarithmic Bounds on an Algorithm for Asymmetric TSP
Anna Palbom
2005
Corpus ID: 12009903
In 1982 Frieze, Galbiati and Maffioli (Networks 12:23-39) published their famous algorithm for approximating the TSP tour in an…
Expand
2002
2002
On the hardness of turn-angle-restricted rectilinear cycle cover problems
Stephane Durocher
,
D. Kirkpatrick
Canadian Conference on Computational Geometry
2002
Corpus ID: 28220857
A cycle cover of a graph G is a collection of disjoint cycles that spans G. Generally, a (possibly disconnected) cycle cover is…
Expand
1997
1997
Cycle Covers of Planar 2-Edge-Connected Graphs
D. Barnette
Graphs Comb.
1997
Corpus ID: 1284605
A graph with n vertices is said to have a small cycle cover provided its edges can be covered with at most (2n − 1)/3 cycles…
Expand