Finding a shortest even hole in polynomial time (Q6057650)
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 7746121
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a shortest even hole in polynomial time |
scientific article; zbMATH DE number 7746121 |
Statements
Finding a shortest even hole in polynomial time (English)
0 references
5 October 2023
0 references
data structure
0 references
induced subgraph
0 references
polynomial-time algorithm
0 references
shortest even hole
0 references
0 references
0 references
0 references
0 references
0.8475655
0 references
0.84029585
0 references
0.84029585
0 references
0.83733153
0 references
0.83531684
0 references
0.83531684
0 references
0.8319678
0 references
0.8307728
0 references
