\(st\)-orientations with few transitive edges

DOI10.1007/978-3-031-22203-0_15arXiv2208.11414OpenAlexW4317393949MaRDI QIDQ6117048

Carla Binucci, Walter Didimo, Maurizio Patrignani

Publication date: 16 August 2023

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

Full work available at URL: https://arxiv.org/abs/2208.11414

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

\(st\)-orientations with few transitive edges ⋮ $st$-Orientations with Few Transitive Edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for computing a parameterized \(st\)-orientation
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Algorithms for plane representations of acyclic digraphs
• Area requirement and symmetry display of planar upward drawings
• Planar lattices and planar graphs
• Computing an st-numbering
• Modular decomposition and transitive orientation
• Three-dimensional orthogonal graph drawing algorithms
• Upward and quasi-upward planarity testing of embedded mixed graphs
• Book embeddability of series-parallel digraphs
• Applications of Parameterized st-Orientations
• Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
• An Approach for Mixed Upward Planarization
• Upward Embeddings and Orientations of Undirected Planar Graphs
• Computing orthogonal drawings with the minimum number of bends
• The complexity of satisfiability problems
• On the Upward Planarity of Mixed Plane Graphs
• Confluent Hasse Diagrams
• On the Perspectives Opened by Right Angle Crossing Drawings
• \(st\)-orientations with few transitive edges

This page was built for publication: \(st\)-orientations with few transitive edges