Finding a noncrossing Steiner forest in plane graphs under a 2-face condition (Q5943823)
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 1648635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a noncrossing Steiner forest in plane graphs under a 2-face condition |
scientific article; zbMATH DE number 1648635 |
Statements
Finding a noncrossing Steiner forest in plane graphs under a 2-face condition (English)
0 references
21 January 2003
0 references
algorithm
0 references
plane graph
0 references
noncrossing
0 references
Steiner tree
0 references
0.7951653599739075
0 references
0.7794157266616821
0 references
0.7622451186180115
0 references