An Algorithm for a Minimum Cover of a Graph
From MaRDI portal
Cites work
Cited in
(37)- A covering problem that is easy for trees but \(\mathbf{NP}\)-complete for trivalent graphs
- Vertex and edge covers with clustering properties: Complexity and algorithms
- Fuzzy minimum weight edge covering problem
- Equivalence between the minimum covering problem and the maximum matching problem
- Nonconvergence, undecidability, and intractability in asymptotic problems
- Covers, matchings and odd cycles of a graph
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs
- Sur le nombre transversal des hypergraphes uniformes
- The distribution of 1-widths of (0,1)-matrices
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Converting triangulations to quadrangulations
- ``Global graph problems tend to be intractable
- Generalized edge packings
- On strongly connected digraphs with bounded cycle length
- On complementary coverage of \({\Omega}_n(T)\)
- Boolean functions with long prime implicants
- Maximum internally stable sets of a graph
- A note on line coverings of graphs
- Benders decomposition for network design covering problems
- Faster algorithms for semi-matching problems
- Gallai-Edmonds decomposition as a pruning technique
- Covers and packings in a family of sets
- Bounds of graph parameters for global constraints
- Edge covering problem under hybrid uncertain environments
- An efficient algorithm for minimumk-covers in weighted graphs
- Approximation algorithms for a geometric set cover problem
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints
- Dulmage-Mendelsohn canonical decomposition as a generic pruning technique
- Approximation algorithms in combinatorial scientific computing
- The minimal cost maximum matching of a graph
- Finding the cyclic covers of a string
- Some combinatorial algorithms on the edge cover number of k-regular connected hypergraphs
- An o(n n)-time approximation scheme for geometric many-to-many matching
- Finding the cyclic covers of a string
- Parameterized complexity of generalizations of edge dominating set
- Covering numbers of regular multigraphs
- On complexity of special maximum matchings constructing
This page was built for publication: An Algorithm for a Minimum Cover of a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3271425)
