Crossing edge minimization in radial outerplanar layered graphs using segment paths

DOI10.1080/10556788.2023.2205646MaRDI QIDQ6065215

Unnamed Author, Joel Antonio Trejo-Sánchez, Unnamed Author, Unnamed Author

Publication date: 11 December 2023

Published in: Optimization Methods and Software (Search for Journal in Brave)

zbMATH Keywords

outerplanar graphsgraph drawingcrossing edges

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Cites Work

• Circular right-angle crossing drawings in linear time
• Obstacle numbers of graphs
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Classes and recognition of curve contact graphs
• Edge crossings in drawings of bipartite graphs
• The graph crossing number and its variants: a survey
• Convex Obstacle Numbers of Outerplanar Graphs and Bipartite Permutation Graphs
• Are Crossings Important for Drawing Large Graphs?
• Drawing Graphs with Right Angle Crossings
• Crossing Number is NP-Complete
• Contact Graphs of Circular Arcs
• Approximation algorithms for NP-complete problems on planar graphs
• Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings
• Experimental Evaluation of Book Drawing Algorithms
• Efficient Algorithms for Ortho-Radial Graph Drawing.
• Minimizing crossings in constrained two-sided circular graph layouts.
• The crossing number of K5,n
• Graph-Theoretic Concepts in Computer Science
• Untangling circular drawings: algorithms and complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Crossing edge minimization in radial outerplanar layered graphs using segment paths