scientific article; zbMATH DE number 7525513

DOI10.4230/LIPICS.ESA.2019.76MaRDI QIDQ5075824zbMATH OpenFDO

Authors Marcel Radermacher, Ignaz Rutter

Publication date 11 May 2022

Full work available at URL https://arxiv.org/abs/1907.01243

zbMATH Keywords

randomizationapproximationexperimentsVC-dimensiongeometric crossing minimization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• A Geometric Heuristic for Rectilinear Crossing Minimization
• scientific article; zbMATH DE number 1109408
• scientific article; zbMATH DE number 1487879
• Efficient randomized algorithms for some geometric optimization problems
• scientific article; zbMATH DE number 1500682
• Crossing minimization in linear embeddings of graphs
• Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem
• Approximating Crossing Minimization in Radial Layouts
• A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
• scientific article; zbMATH DE number 1974113

Cites work

• scientific article; zbMATH DE number 2013741 (Why is no real title available?)
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• A Geometric Heuristic for Rectilinear Crossing Minimization
• A greedy heuristic for crossing-angle maximization
• A heuristic approach towards drawings of graphs with high crossing resolution
• Algorithms for Reporting and Counting Geometric Intersections
• Computational search of small point sets with small rectilinear crossing number
• Crossing Number is NP-Complete
• Drawing large graphs by multilevel maxent-stress optimization
• Generating Random Regular Graphs Quickly
• Graph Drawing
• Improved bounds on the sample complexity of learning
• Inserting an edge into a planar graph
• Inserting multiple edges into a planar graph
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Relative (p, )-approximations in geometry
• Some provably hard crossing number problems
• The University of Florida sparse matrix collection

Cited in

(7)

• Crossing edge minimization in radial outerplanar layered graphs using segment paths
• Computational search of small point sets with small rectilinear crossing number
• An SDP approach to multi-level crossing minimization
• Inserting an edge into a geometric embedding
• A Geometric Heuristic for Rectilinear Crossing Minimization
• ALMOST EUCLIDEAN SECTIONS OF THE N-DIMENSIONAL CROSS-POLYTOPE USING O(N) RANDOM BITS
• scientific article; zbMATH DE number 1109408 (Why is no real title available?)

Describes a project that uses

Uses Software

• SparseMatrix
• OGDF
• CGAL

This page was built for publication:

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