Fixed-point definability and polynomial time on graphs with excluded minors (Q5395695): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2371656.2371662 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045027298 / rank | |||
Normal rank | |||
Latest revision as of 22:17, 19 March 2024
scientific article; zbMATH DE number 6258093
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fixed-point definability and polynomial time on graphs with excluded minors |
scientific article; zbMATH DE number 6258093 |
Statements
Fixed-point definability and polynomial time on graphs with excluded minors (English)
0 references
17 February 2014
0 references
descriptive complexity
0 references
fixed-point logics
0 references
graph isomorphism
0 references
graph minors
0 references
