Bandwidth of bipartite permutation graphs in polynomial time (Q1044045)
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 5645015
| 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 5645015 |
Statements
Bandwidth of bipartite permutation graphs in polynomial time (English)
0 references
10 December 2009
0 references
NP-complete problem
0 references
graph layout problem
0 references
polynomial-time algorithm
0 references
bandwidth
0 references
bipartite permutation graphs
0 references
0 references
0 references
0.9999999
0 references
0.9651945
0 references
0.90583867
0 references
0.90583867
0 references
0.9051509
0 references
0.9044243
0 references
0.9044243
0 references
0.89079165
0 references
