Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
EloiFerrer (talk | contribs) Merged Item from Q2945193 |
||||||||||||||
| (3 intermediate revisions by 2 users not shown) | |||||||||||||||
| aliases / en / 0 | aliases / en / 0 | ||||||||||||||
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs | |||||||||||||||
| description / en | description / en | ||||||||||||||
scientific article | scientific article; zbMATH DE number 6479934 | ||||||||||||||
| Property / title | |||||||||||||||
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs (English) | |||||||||||||||
| Property / title: Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Open document ID | |||||||||||||||
| Property / zbMATH Open document ID: 1417.05210 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / DOI | |||||||||||||||
| Property / DOI: 10.1007/978-3-319-12340-0_20 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / published in | |||||||||||||||
| Property / published in: Graph-Theoretic Concepts in Computer Science / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / publication date | |||||||||||||||
9 September 2015
| |||||||||||||||
| Property / publication date: 9 September 2015 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Mathematics Subject Classification ID | |||||||||||||||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH DE Number | |||||||||||||||
| Property / zbMATH DE Number: 6479934 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / OpenAlex ID | |||||||||||||||
| Property / OpenAlex ID: W1551586077 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / arXiv ID | |||||||||||||||
| Property / arXiv ID: 1407.6761 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Latest revision as of 09:26, 6 May 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
