scientific article; zbMATH DE number 7236457

DOI10.4230/LIPIcs.SoCG.2018.53zbMath1489.68195MaRDI QIDQ5115821

Fabian Klute, Martin Nöllenburg

Publication date: 18 August 2020

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

zbMATH Keywords

graph drawingcrossing minimizationcircle graphsbounded-degree maximum-weight induced subgraphscircular layouts

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Grid recognition: classical and parameterized computational perspectives ⋮ Connecting the dots (with minimum crossings)

Uses Software

• OGDF
• Circos

Cites Work

• Unnamed Item
• Unnamed Item
• On bounded-degree vertex deletion parameterized by treewidth
• The complexity of domination problems in circle graphs
• An annotated bibliography on 1-planarity
• Large Induced Subgraphs via Triangulations and CMSO
• The Bundled Crossing Number
• On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
• Improved Circular Layouts
• Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
• Experimental Evaluation of Book Drawing Algorithms
• The book crossing number of a graph
• TREEWIDTH OF CIRCLE GRAPHS
• Algorithms and Computation
• Crossing minimization in linear embeddings of graphs
• Node-and edge-deletion NP-complete problems
• Algorithms for a maximum clique and a maximum independent set of a circle graph
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: