On complementary coverage of _n(T)
From MaRDI portal
Publication:2437354
Recommendations
Cites work
- An Algorithm for a Minimum Cover of a Graph
- Combinatorial matrix classes
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Matching theory
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Packing and covering with linear programming: a survey
- The diameter of the acyclic Birkhoff polytope
- Vertex and edge covers with clustering properties: Complexity and algorithms
Cited in
(5)
This page was built for publication: On complementary coverage of \({\Omega}_n(T)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437354)