Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up (Q3434987): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q60488760, #quickstatements; #temporary_batch_1711015421434 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60488760 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:15, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up |
scientific article |
Statements
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up (English)
0 references
3 May 2007
0 references
tree-width
0 references
graph algorithms
0 references
fixed-parameter algorithm
0 references
graph minors
0 references
