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
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
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)
  • figure 1
Is this relevant?
2014
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)
  • figure 1
  • figure 2
Is this relevant?
2011
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)
  • figure 1
  • figure 2
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
Many important combinatorial problems can be modelled as constraint satisfaction problems, hence identifying polynomial-time… (More)
Is this relevant?
2006
2006
Confluent drawing is a technique that allows some non-planar graphs to be visualized in a planar way. This approach merges edges… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Given a parallel corpus, semantic projection attempts to transfer semantic role annotations from one language to another… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2006
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?