# Edge cover

Known as: Edge covering, Minimum edge cover, Edge cover problemÂ
In graph theory, an edge cover of a graph is a set of edges such that every vertex of the graph is incident to at least one edge of the set.Inâ€¦Â (More)
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
• SC18: International Conference for Highâ€¦
• 2018
We explore the problem of sharing data that pertains to individuals with anonymity guarantees, where each user requires a desiredâ€¦Â (More)
Is this relevant?
2014
2014
• SODA
• 2014
An edge cover of a graph is a set of edges such that every vertex has at least an adjacent edge in it. We design a very simpleâ€¦Â (More)
Is this relevant?
2014
2014
• ESA
• 2014
An edge cover of a graph is a set of edges in which each vertex has at least one of its incident edges. The problem of countingâ€¦Â (More)
Is this relevant?
2011
2011
• Eur. J. Comb.
• 2011
Let G be a simple graph of order n and size m. An edge covering of the graph G is a set of edges such that every vertex of theâ€¦Â (More)
Is this relevant?
2010
2010
In an n by n complete bipartite graph with independent exponentially distributed edge costs, we ask for the minimum total cost ofâ€¦Â (More)
Is this relevant?
2007
2007
kâ‰¤m Ek and m is minimum. Two related and reasonably well-studied problems are the Minimum Biclique Cover (MBC), where Hk areâ€¦Â (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
• ACM Trans. Algorithms
• 2006
Many important combinatorial problems can be modelled as constraint satisfaction problems, hence identifying polynomial-timeâ€¦Â (More)
Is this relevant?
2006
2006
• Graph Drawing
• 2006
Confluent drawing is a technique that allows some non-planar graphs to be visualized in a planar way. This approach merges edgesâ€¦Â (More)
Is this relevant?
2006
2006
• ACL
• 2006
Given a parallel corpus, semantic projection attempts to transfer semantic role annotations from one language to anotherâ€¦Â (More)
Is this relevant?
2006
2006
• J. Discrete Algorithms
• 2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t â‰¥ 1), which generalise the notions of a vertexâ€¦Â (More)
Is this relevant?