A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571)
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 parallel algorithm for generating bicompatible elimination orderings of proper interval graphs |
scientific article; zbMATH DE number 5773850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs |
scientific article; zbMATH DE number 5773850 |
Statements
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (English)
0 references
20 August 2010
0 references
graph algorithms
0 references
parallel algorithms
0 references
chordal graphs
0 references
proper interval graphs
0 references
0.8019610047340393
0 references
0.7939074039459229
0 references
