A faster algorithm to recognize even-hole-free graphs (Q2347846): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 447 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3103742520 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1311.0358 / rank | |||
Normal rank | |||
Latest 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
