A robust algorithm for bisecting a triconnected graph with two resource sets (Q2566018)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A robust algorithm for bisecting a triconnected graph with two resource sets |
scientific article |
Statements
A robust algorithm for bisecting a triconnected graph with two resource sets (English)
0 references
22 September 2005
0 references
graph embeddings
0 references
ham-sandwich cut
0 references
0 references
