Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q4899040): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:51, 8 February 2024
scientific article; zbMATH DE number 6122004
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time |
scientific article; zbMATH DE number 6122004 |
Statements
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (English)
0 references
4 January 2013
0 references
graph algorithms
0 references
graph layout problems
0 references
cutwidth
0 references
bipartite permutation graphs
0 references
