On complementary coverage of \({\Omega}_n(T)\)

DOI10.1016/j.laa.2013.08.011zbMath1282.05012OpenAlexW2034767008MaRDI QIDQ2437354

Liliana Costa, Enide Andrade Martins, Nair Maria Maia De Abreu

Publication date: 3 March 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2013.08.011

zbMATH Keywords

acyclic Birkhoff polytope\(T\)-component\(T\)-edge cover\(T\)-vertex covercomplementary coverage

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Polytopes and polyhedra (52B99) Stochastic matrices (15B51)

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex and edge covers with clustering properties: Complexity and algorithms
• 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
• An Algorithm for a Minimum Cover of a Graph

This page was built for publication: On complementary coverage of \({\Omega}_n(T)\)