scientific article; zbMATH DE number 7525513

DOI10.4230/LIPIcs.ESA.2019.76MaRDI QIDQ5075824

Marcel Radermacher, Ignaz Rutter

Publication date: 11 May 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

randomizationapproximationVC-dimensionexperimentsgeometric crossing minimization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Inserting an edge into a geometric embedding

Uses Software

• CGAL
• OGDF
• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relative \((p,\varepsilon )\)-approximations in geometry
• Some provably hard crossing number problems
• A heuristic approach towards drawings of graphs with high crossing resolution
• A greedy heuristic for crossing-angle maximization
• Inserting an edge into a planar graph
• Drawing Large Graphs by Multilevel Maxent-Stress Optimization
• The university of Florida sparse matrix collection
• Algorithms for Reporting and Counting Geometric Intersections
• Crossing Number is NP-Complete
• Generating Random Regular Graphs Quickly
• A Geometric Heuristic for Rectilinear Crossing Minimization
• Computational search of small point sets with small rectilinear crossing number
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Graph Drawing
• Improved bounds on the sample complexity of learning

This page was built for publication: