Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs (Q6143971): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:40, 10 July 2024
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
5 January 2024
0 references
connected graph
0 references
input graph
0 references
partition problem
0 references
connected subgraph
0 references
edge disjoint
0 references
