A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Graph-Theoretic Concepts in Computer Science / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph-Theoretic Concepts in Computer Science / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Trivially perfect graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3203054 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4161356 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Comparability Graph of a Tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quasi-threshold graphs / rank | |||
Normal rank | |||
Revision as of 16:32, 2 July 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
