Three-in-a-tree in near linear time (Q5145012)
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: Three-in-a-tree in near linear time |
scientific article; zbMATH DE number 7298327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three-in-a-tree in near linear time |
scientific article; zbMATH DE number 7298327 |
Statements
Three-in-a-tree in near linear time (English)
0 references
19 January 2021
0 references
induced subgraph detection
0 references
SPQR-tree
0 references
dynamic graph algorithm
0 references
even hole
0 references
graph recognition
0 references
odd hole
0 references
perfect graph
0 references
top tree
0 references
