A faster algorithm to recognize even-hole-free graphs (Q2347846)
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 6444327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm to recognize even-hole-free graphs |
scientific article; zbMATH DE number 6444327 |
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
0 references
0.9812681078910828
0 references
0.9293088912963868
0 references
0.9293088912963868
0 references
0.8968743085861206
0 references
0.8933342099189758
0 references
