A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.12.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2089241552 / rank | |||
Normal rank | |||
Revision as of 03:05, 20 March 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
