Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2898301962 / rank | |||
Revision as of 04:16, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs |
scientific article |
Statements
Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (English)
0 references
11 March 2019
0 references
branch-/tree-decompositions
0 references
grid minor
0 references
planar graphs
0 references
approximation algorithm
0 references
