Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs (Q6143971)

From MaRDI portal
Revision as of 11:24, 22 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7784156
Language Label Description Also known as
English
Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs
scientific article; zbMATH DE number 7784156

    Statements

    Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs (English)
    0 references
    0 references
    0 references
    5 January 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    connected graph
    0 references
    input graph
    0 references
    partition problem
    0 references
    connected subgraph
    0 references
    edge disjoint
    0 references