Crossing edge minimization in radial outerplanar layered graphs using segment paths

DOI10.1080/10556788.2023.2205646MaRDI QIDQ6065215zbMATH OpenFDO

Authors Joel Trejo-Sanchez

Publication date 11 December 2023

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2023.2205646

zbMATH Keywords

crossing edgesgraph drawingouterplanar graphs

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithms for minimizing edge crossings in radial drawings
• New Approximation to the One-sided Radial Crossing Minimization
• Approximating Crossing Minimization in Radial Layouts
• scientific article; zbMATH DE number 1974128
• scientific article; zbMATH DE number 7525513

Cites work

• Approximation algorithms for NP-complete problems on planar graphs
• Are crossings important for drawing large graphs?
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Circular right-angle crossing drawings in linear time
• Classes and recognition of curve contact graphs
• Contact Graphs of Circular Arcs
• Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs
• Crossing Number is NP-Complete
• Drawing Graphs with Right Angle Crossings
• Edge crossings in drawings of bipartite graphs
• Efficient Algorithms for Ortho-Radial Graph Drawing.
• Everyday calculus. Discovering the hidden math all around us
• Experimental evaluation of book drawing algorithms
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 3509333 (Why is no real title available?)
• scientific article; zbMATH DE number 2079381 (Why is no real title available?)
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• Introduction to algorithms.
• Minimizing crossings in constrained two-sided circular graph layouts
• Obstacle numbers of graphs
• The crossing number of K5,n
• The graph crossing number and its variants: a survey
• Towards a topology-shape-metrics framework for ortho-radial drawings
• Untangling circular drawings: algorithms and complexity

Cited in

(1)

• scientific article; zbMATH DE number 7236457 (Why is no real title available?)

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

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