A faster algorithm to recognize even-hole-free graphs (Q2347846): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1311.0358 / rank | |||
Normal rank |
Revision as of 05:40, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A faster algorithm to recognize even-hole-free graphs |
scientific article |
Statements
A faster algorithm to recognize even-hole-free graphs (English)
0 references
10 June 2015
0 references
even hole
0 references
decomposition-based detection algorithm
0 references
extended clique tree
0 references
2-join
0 references
star-cutset
0 references
diamond
0 references
beetle
0 references
tracker
0 references