Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530)
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: Bandwidth of Bipartite Permutation Graphs in Polynomial Time |
scientific article; zbMATH DE number 5263909
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bandwidth of Bipartite Permutation Graphs in Polynomial Time |
scientific article; zbMATH DE number 5263909 |
Statements
Bandwidth of Bipartite Permutation Graphs in Polynomial Time (English)
0 references
15 April 2008
0 references
0 references
0 references
0.9598730802536012
0 references
0.8896554112434387
0 references
0.8198593258857727
0 references
0.8178373575210571
0 references
