A robust algorithm for bisecting a triconnected graph with two resource sets (Q2566018)
From MaRDI portal
!
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 2207183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A robust algorithm for bisecting a triconnected graph with two resource sets |
scientific article; zbMATH DE number 2207183 |
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
0.8347476124763489
0 references
0.8319189548492432
0 references
0.8283897638320923
0 references
