New Approximation to the One-sided Radial Crossing Minimization

DOI10.7155/JGAA.00182zbMATH Open1176.68145OpenAlexW2161868633MaRDI QIDQ3184609

Seok-Hee Hong, Hiroshi Nagamochi

Publication date: 21 October 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00182

zbMATH Keywords

radial drawing of a graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization

This page was built for publication: New Approximation to the One-sided Radial Crossing Minimization

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