Pages that link to "Item:Q3271425"
From MaRDI portal
The following pages link to An Algorithm for a Minimum Cover of a Graph (Q3271425):
Displayed 33 items.
- Gallai-Edmonds decomposition as a pruning technique (Q301487) (← links)
- Edge covering problem under hybrid uncertain environments (Q371513) (← links)
- Approximation algorithms for a geometric set cover problem (Q423912) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Dulmage-Mendelsohn canonical decomposition as a generic pruning technique (Q487628) (← links)
- Covering numbers of regular multigraphs (Q753843) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- A covering problem that is easy for trees but \(\mathbf{NP}\)-complete for trivalent graphs (Q1005227) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Fuzzy minimum weight edge covering problem (Q1031614) (← links)
- Equivalence between the minimum covering problem and the maximum matching problem (Q1068107) (← links)
- Nonconvergence, undecidability, and intractability in asymptotic problems (Q1095135) (← links)
- Covers, matchings and odd cycles of a graph (Q1219306) (← links)
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs (Q1234553) (← links)
- Sur le nombre transversal des hypergraphes uniformes (Q1245241) (← links)
- The distribution of 1-widths of (0,1)-matrices (Q1250102) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Converting triangulations to quadrangulations (Q1384213) (← links)
- ``Global'' graph problems tend to be intractable (Q1820581) (← links)
- Generalized edge packings (Q1825138) (← links)
- On strongly connected digraphs with bounded cycle length (Q1923587) (← links)
- On complementary coverage of \({\Omega}_n(T)\) (Q2437354) (← links)
- Boolean functions with long prime implicants (Q2445231) (← links)
- Maximum internally stable sets of a graph (Q2530476) (← links)
- A note on line coverings of graphs (Q2560427) (← links)
- Benders decomposition for network design covering problems (Q2669611) (← links)
- Faster Algorithms for Semi-Matching Problems (Q2799478) (← links)
- Covers and packings in a family of sets (Q3292586) (← links)
- Bounds of graph parameters for global constraints (Q3534209) (← links)
- An efficient algorithm for minimumk-covers in weighted graphs (Q4083700) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- The minimal cost maximum matching of a graph (Q5639540) (← links)
- Finding the cyclic covers of a string (Q6091155) (← links)