Heuristics for the maximum 2-layer RAC subgraph problem

DOI10.1007/978-3-642-28076-4_21MaRDI QIDQ2889915zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Salvatore A. Romeo

Publication date 8 June 2012

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28076-4_21

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• 2-layer right angle crossing drawings
• Drawing graphs in two layers
• New bounds on the barycenter heuristic for bipartite graph drawing.
• 2-layer right angle crossing drawings
• The straight-line RAC drawing problem is NP-hard

Cited in

(3)

• Right Angle Crossing Drawings of Graphs
• 2-layer right angle crossing drawings
• On the 2-layer window width minimization problem

This page was built for publication: Heuristics for the maximum 2-layer RAC subgraph problem

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