A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386)
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 5694945
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements |
scientific article; zbMATH DE number 5694945 |
Statements
A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (English)
0 references
19 April 2010
0 references
algorithms
0 references
combinatorial problems
0 references
graph algorithms
0 references
recognizing trivially perfect graphs
0 references
lexicographic BFS
0 references
LBFS
0 references
lexicographic breadth first search
0 references
0.7857367992401123
0 references
0.783338725566864
0 references
0.7770991325378418
0 references
0.7748925685882568
0 references
