ALL SEPARATING TRIANGLES IN A PLANE GRAPH CAN BE OPTIMALLY "BROKEN" IN POLYNOMIAL TIME (Q5249048)
From MaRDI portal
scientific article; zbMATH DE number 6432050
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ALL SEPARATING TRIANGLES IN A PLANE GRAPH CAN BE OPTIMALLY "BROKEN" IN POLYNOMIAL TIME |
scientific article; zbMATH DE number 6432050 |
Statements
ALL SEPARATING TRIANGLES IN A PLANE GRAPH CAN BE OPTIMALLY "BROKEN" IN POLYNOMIAL TIME (English)
0 references
29 April 2015
0 references
