Linear time algorithms for k-cutwidth problem

DOI10.1007/3-540-56279-6_54MaRDI QIDQ4246756zbMATH OpenFDO

Authors Maw Hwa Chen, Sing-Ling Lee

Publication date 15 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56279-6_54

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(1)

• Derivation of algorithms for cutwidth and related graph layout parameters

This page was built for publication: Linear time algorithms for \(k\)-cutwidth problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246756)