Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases (Q1129014)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for a mixed k-partition problem of graphs without specifying bases |
scientific article; zbMATH DE number 1190163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for a mixed \(k\)-partition problem of graphs without specifying bases |
scientific article; zbMATH DE number 1190163 |
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
0.7991492748260498
0 references
