Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q4899040): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/110830514 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973196832 / rank | |||
Normal rank | |||
Latest revision as of 18:32, 19 March 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
