Graph properties checkable in linear time in the number of vertices (Q596315)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2085637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph properties checkable in linear time in the number of vertices |
scientific article; zbMATH DE number 2085637 |
Statements
Graph properties checkable in linear time in the number of vertices (English)
0 references
10 August 2004
0 references
Linear time
0 references
Nondeterminism
0 references
Complexity lower bounds
0 references
Combinatorial
0 references
problems
0 references
Finite model theory
0 references
Existential second-order logic
0 references
0 references
0.7368446588516235
0 references
