Computing the cutwidth of bipartite permutation graphs in linear time (Q4899040)
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: Computing the cutwidth of bipartite permutation graphs in linear time |
scientific article; zbMATH DE number 6122004
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.99929541349411
0 references
0.8516741991043091
0 references
0.8359286785125732
0 references
0.8250114321708679
0 references
0.8198593258857727
0 references
