Pathwidth of cubic graphs and exact algorithms (Q1045933)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Pathwidth of cubic graphs and exact algorithms |
scientific article; zbMATH DE number 5650196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pathwidth of cubic graphs and exact algorithms |
scientific article; zbMATH DE number 5650196 |
Statements
Pathwidth of cubic graphs and exact algorithms (English)
0 references
18 December 2009
0 references
treewidth
0 references
pathwidth
0 references
cubic graph
0 references
exact exponential algorithm
0 references
maximum independent set
0 references
max-cut
0 references
minimum dominating set
0 references
graph algorithms
0 references
0.7888654470443726
0 references
0.7812880873680115
0 references
0.7750203013420105
0 references
0.7675371170043945
0 references
