Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
One-Sided Local Crossing Minimization
Panos Giannopoulos, Miriam Goetze, Grzegorz Gutowski +6
Drawing graphs with the minimum number of crossings is a classical problem that has been studied extensively. Many restricted versions of the problem have been considered. For exam…
cs.DS2024
Recognizing 2-Layer and Outer -Planar Graphs
Yasuaki Kobayashi, Yuto Okada, Alexander Wolff
The crossing number of a graph is the least number of crossings over all drawings of the graph in the plane. Computing the crossing number of a given graph is NP-hard, but fixed-pa…