Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases (Q1129014): Difference between revisions
From MaRDI portal
Latest revision as of 15:47, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases |
scientific article |
Statements
Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases (English)
0 references
13 August 1998
0 references
\(k\)-partition of graph
0 references
\(k\)-edge-connected graphs
0 references
minimal biconnected graphs
0 references
nonseparating ear decomposition
0 references
Eulerian cycle
0 references
0 references
0 references