A fixed-parameter algorithm for dominance drawings of DAGs

DOI10.1016/J.TCS.2024.114819MaRDI QIDQ6634372zbMATH OpenFDO

Authors Giacomo Ortali, Ioannis G. Tollis

Publication date 7 November 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114819

zbMATH Keywords

(weak) dominance drawingsFPT-algorithmsmodular width

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A decomposition theorem for partially ordered sets
• Area requirement and symmetry display of planar upward drawings
• Better bounds for poset dimension and boxicity
• Diametral pairs of linear extensions
• Dominance drawings for DAGs with bounded modular width
• Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
• Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
• scientific article; zbMATH DE number 6472574 (Why is no real title available?)
• scientific article; zbMATH DE number 3318560 (Why is no real title available?)
• Inequalities in Dimension Theory for Posets
• Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
• Modular decomposition and transitive orientation
• Parameterized Algorithms for Modular-Width
• Partially ordered sets.
• The dimension of planar posets

This page was built for publication: A fixed-parameter algorithm for dominance drawings of DAGs

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