Dominance drawings for DAGs with bounded modular width

DOI10.1007/978-3-031-23101-8_5OpenAlexW4313429571MaRDI QIDQ6169511

Giacomo Ortali, Ioannis. G. Tollis

Publication date: 14 August 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-23101-8_5

zbMATH Keywords

FPT-algorithmsmodular width(weak) dominance drawings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameterized algorithms for directed modular width
• Area requirement and symmetry display of planar upward drawings
• Modular decomposition and transitive orientation
• Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
• A decomposition theorem for partially ordered sets
• Parameterized Algorithms for Modular-Width
• The Complexity of the Partial Order Dimension Problem
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
• Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
• Partially Ordered Sets

This page was built for publication: Dominance drawings for DAGs with bounded modular width