Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs (Q5317569)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs |
scientific article; zbMATH DE number 2206248
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs |
scientific article; zbMATH DE number 2206248 |
Statements
Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs (English)
0 references
16 September 2005
0 references
bipartite permutation graphs
0 references
bipartite trapezoid graphs
0 references
proper circular arc graphs
0 references
lexicographic breadth first search
0 references
certifying algorithms
0 references
forbidden subgraph characterizations
0 references
0.90265226
0 references
0.89113075
0 references
0.88606715
0 references
0.8786725
0 references
0.8774631
0 references
0.86880636
0 references
