Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (Q3057614)
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
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time |
scientific article |
Statements
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (English)
0 references
16 November 2010
0 references