Growing balanced covering sets
Growing balanced covering sets
About this item
Full title
Author / Creator
Publisher
Ithaca: Cornell University Library, arXiv.org
Journal title
Language
English
Formats
Publication information
Publisher
Ithaca: Cornell University Library, arXiv.org
Subjects
More information
Scope and Contents
Contents
Given a bipartite graph with bipartition \((A,B)\) where \(B\) is equipartitioned into \(k\ge2\) blocks, can the vertices in \(A\) be picked one by one so that at every step, the picked vertices cover roughly the same number of vertices in each of these blocks? We show that, if each block has cardinality \(m\), the vertices in \(B\) have the same d...
Alternative Titles
Full title
Growing balanced covering sets
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2492487003
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2492487003
Other Identifiers
E-ISSN
2331-8422