Heuristics for the Maximum 2-layer RAC Subgraph Problem

DOI10.1007/978-3-642-28076-4_21zbMath1350.68209OpenAlexW1610635334WikidataQ62042459 ScholiaQ62042459MaRDI QIDQ2889915

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

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

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

Related Items

On RAC drawings of 1-planar graphs, 2-layer right angle crossing drawings, Right Angle Crossing Drawings of Graphs