A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809)
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: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs |
scientific article; zbMATH DE number 2083751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs |
scientific article; zbMATH DE number 2083751 |
Statements
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (English)
0 references
6 August 2004
0 references
Unit interval graphs
0 references
Proper interval graphs
0 references
Graph recognition algorithm
0 references
Lexicographic breadth first search
0 references
0 references
0 references
0.93121374
0 references
0.89726543
0 references
0.88250196
0 references
0 references
0.86573565
0 references
0.86429423
0 references
