Bounds for the number of meeting edges in graph partitioning (Q5355069)

From MaRDI portal
Revision as of 00:25, 23 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6770127
Language Label Description Also known as
English
Bounds for the number of meeting edges in graph partitioning
scientific article; zbMATH DE number 6770127

    Statements

    Bounds for the number of meeting edges in graph partitioning (English)
    0 references
    0 references
    0 references
    6 September 2017
    0 references
    weighted hypergraph
    0 references
    partition
    0 references
    judicious partition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references