On optimal exact coverings of a graph in the class of weakly dense bases

DOI10.1515/1569392041938776zbMath1105.05057OpenAlexW1997189597MaRDI QIDQ3409840

Z. S. Lozhkina

Publication date: 20 November 2006

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/1569392041938776

zbMATH Keywords

complexityalgorithmsasymptotic behaviour\((0,1)\)-matricesShannon function

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• On weakly dense bases in a class of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On optimal exact coverings of a graph in the class of weakly dense bases