Experimental Evaluation of Book Drawing Algorithms

DOI10.1007/978-3-319-73915-1_19zbMath1503.68225arXiv1708.09221OpenAlexW2753334663MaRDI QIDQ4625114

Jonathan Klawitter, Martin Nöllenburg, Tamara Mchedlidze

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number ⋮ Fixed-parameter tractability for book drawing with bounded number of crossings per edge ⋮ Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ Mixed linear layouts: complexity, heuristics, and experiments ⋮ Experimental Evaluation of Book Drawing Algorithms ⋮ A greedy heuristic for crossing-angle maximization ⋮ On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering ⋮ Unnamed Item ⋮ The Turing Test for Graph Drawing Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the pagenumber of the cube-connected cycles
• Differential cryptanalysis of DES-like cryptosystems
• Embedding planar graphs in four pages
• The book thickness of a graph
• A genetic algorithm for finding the pagenumber of interconnection networks
• The \textsf{Simeck} family of lightweight block ciphers
• Integral attacks on round-reduced Bel-T-256
• MILP-based differential attack on round-reduced GIFT
• A framework and algorithms for circular drawings of graphs
• An analysis of some linear graph layout heuristics
• Book embeddability of series-parallel digraphs
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
• Structural Evaluation by Generalized Integral Property
• Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers
• Crossing Minimisation Heuristics for 2-page Drawings
• Improved Circular Layouts
• Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
• Experimental Evaluation of Book Drawing Algorithms
• The book crossing number of a graph
• New Impossible Differential Search Tool from Design and Cryptanalysis Aspects
• Crossing minimization in linear embeddings of graphs
• The pagenumber of \(k\)-trees is \(O(k)\)

This page was built for publication: Experimental Evaluation of Book Drawing Algorithms