Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129011837, #quickstatements; #temporary_batch_1726270017965 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129011837 / rank | |||
Normal rank | |||
Latest revision as of 01:32, 14 September 2024
scientific article; zbMATH DE number 6479934
- Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs |
scientific article; zbMATH DE number 6479934 |
|
Statements
Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (English)
0 references
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs (English)
0 references
11 March 2019
0 references
9 September 2015
0 references
branch-/tree-decompositions
0 references
grid minor
0 references
planar graphs
0 references
approximation algorithm
0 references
0 references
0 references
0 references
