A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:22, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements |
scientific article |
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
