A new LBFS-based algorithm for cocomparability graph recognition (Q344849)
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 new LBFS-based algorithm for cocomparability graph recognition |
scientific article; zbMATH DE number 6656013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new LBFS-based algorithm for cocomparability graph recognition |
scientific article; zbMATH DE number 6656013 |
Statements
A new LBFS-based algorithm for cocomparability graph recognition (English)
0 references
24 November 2016
0 references
cocomparability graphs
0 references
comparability graphs
0 references
graph search LBFS
0 references
graph search \(\mathrm{LBFS}^+\)
0 references
transitive orientation
0 references
0 references
0.8097021579742432
0 references
0.7987240552902222
0 references
0.7588832974433899
0 references
0.757361888885498
0 references
