Algorithms for Classes of Graphs with Bounded Expansion (Q5851090): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): conf/wg/DvorakK09, #quickstatements; #temporary_batch_1731468600454 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1684832175 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/wg/DvorakK09 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:31, 13 November 2024
scientific article; zbMATH DE number 5661043
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for Classes of Graphs with Bounded Expansion |
scientific article; zbMATH DE number 5661043 |
Statements
Algorithms for Classes of Graphs with Bounded Expansion (English)
0 references
21 January 2010
0 references
algorithmic results
0 references
sparse graphs
0 references
graphs with bounded expansion
0 references
nowhere-dense graphs
0 references
proper minor-closed classes of graphs
0 references
bounded tree-width
0 references
locally bounded tree-width
0 references
locally excluding a minor
0 references
