Bandwidth of bipartite permutation graphs in polynomial time (Q1044045)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bandwidth of bipartite permutation graphs in polynomial time |
scientific article |
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
