The computational complexity of graph contractions II: Two tough polynomially solvable cases (Q3632967): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph minors. XIII: The disjoint paths problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Polynomial Solution to the Undirected Two Paths Problem / rank | |||
Normal rank | |||
Latest revision as of 15:42, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of graph contractions II: Two tough polynomially solvable cases |
scientific article |
Statements
The computational complexity of graph contractions II: Two tough polynomially solvable cases (English)
0 references
16 June 2009
0 references
graph
0 references
edge contraction
0 references
dominating vertex
0 references
wheel
0 references
computational complexity
0 references
0 references
