Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs (Q3394985)
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: Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs |
scientific article; zbMATH DE number 5597387
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs |
scientific article; zbMATH DE number 5597387 |
Statements
Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs (English)
0 references
20 August 2009
0 references
common interval
0 references
permutation
0 references
\(PQ\)-tree
0 references
modular decomposition
0 references
0.9942929148674012
0 references
0.8502371311187744
0 references
0.8476552367210388
0 references
0.8388404846191406
0 references
