New upper bounds on the decomposability of planar graphs (Q3376690): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56679466 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.20121 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4232845306 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4471291 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: STACS 2004 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4708588 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3994574 / rank | |||
Normal rank | |||
Latest revision as of 12:26, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New upper bounds on the decomposability of planar graphs |
scientific article |
Statements
New upper bounds on the decomposability of planar graphs (English)
0 references
24 March 2006
0 references
tree-width
0 references
branch-width
0 references
separation theorems
0 references
parameterized algorithms
0 references
subexponential algorithms
0 references
