Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time (2012)
Attributed to:
Exact algorithms for NP-hard problems
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1137/110830514
Publication URI: http://dx.doi.org/10.1137/110830514
Type: Journal Article/Review
Parent Publication: SIAM Journal on Discrete Mathematics
Issue: 3