Subcube Coverings of Random Spanning Subgraphs of then-Cube

DOI10.1002/MANA.19851200128zbMATH Open0579.05048OpenAlexW2093145688MaRDI QIDQ3701458FDOQ3701458

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

Recommendations

• scientific article; zbMATH DE number 3954974
• scientific article; zbMATH DE number 3966129
• scientific article; zbMATH DE number 3977048
• scientific article; zbMATH DE number 4039957
• scientific article; zbMATH DE number 4010568

zbMATH Keywords

minimizationrandom graphsn-cubecomplexity ofcoverings by subgraphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Covering minimum spanning trees of random subgraphs
• Covering minimum spanning trees of random subgraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random subcube intersection graphs. I: Cliques and covering
• Asymptotic normality of subcubes in random subgraphs of the \(n\)-cube
• Analysis of greedy algorithm for vertex covering of random graph by cubes
• Title not available (Why is that?)
• Title not available (Why is that?)

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)