An Algorithm for a Minimum Cover of a Graph
From MaRDI portal
Publication:3271425
DOI10.2307/2033599zbMath0093.37702MaRDI QIDQ3271425
Michael O. Rabin, Robert Z. Norman
Publication date: 1959
Full work available at URL: https://doi.org/10.2307/2033599
Related Items
The minimal cost maximum matching of a graph, Gallai-Edmonds decomposition as a pruning technique, Edge covering problem under hybrid uncertain environments, 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, Covering numbers of regular multigraphs, On complexity of special maximum matchings constructing, 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, Faster Algorithms for Semi-Matching Problems, Covers and packings in a family of sets, Bounds of graph parameters for global constraints, An efficient algorithm for minimumk-covers in weighted graphs
Cites Work
