Subcube Coverings of Random Spanning Subgraphs of then-Cube

DOI10.1002/MANA.19851200128MaRDI QIDQ3701458zbMATH OpenOpenAlexFDO

Authors Karl Weber

Publication date 1985

Published in Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/mana.19851200128

zbMATH Keywords

complexity ofcoverings by subgraphsminimizationn-cuberandom graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Cited in

(10)

• Asymptotic normality of subcubes in random subgraphs of the \(n\)-cube
• Random subcube intersection graphs. I: Cliques and covering
• scientific article; zbMATH DE number 3889585 (Why is no real title available?)
• Covering minimum spanning trees of random subgraphs
• Analysis of greedy algorithm for vertex covering of random graph by cubes
• scientific article; zbMATH DE number 3954974 (Why is no real title available?)
• scientific article; zbMATH DE number 3977048 (Why is no real title available?)
• scientific article; zbMATH DE number 4039957 (Why is no real title available?)
• Spanning Subgraphs of Random Graphs
• Covering minimum spanning trees of random subgraphs

This page was built for publication: Subcube Coverings of Random Spanning Subgraphs of then-Cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701458)