Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs (Q6143971)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7784156
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0.84613037109375
0 references
0.820661187171936
0 references
0.819389283657074
0 references
0.8137484192848206
0 references
