Fixed-point definability and polynomial time on chordal graphs and line graphs (Q3586010)
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: Fixed-point definability and polynomial time on chordal graphs and line graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fixed-point definability and polynomial time on chordal graphs and line graphs |
scientific article |
Statements
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (English)
0 references
3 September 2010
0 references
descriptive complexity theory
0 references
fixed-point logic
0 references
0.8153184056282043
0 references
0.8122726082801819
0 references
0.7981436252593994
0 references
