A natural quadratic approach to the generalized graph layering problem

DOI10.1007/978-3-030-35802-0_40OpenAlexW2990132662MaRDI QIDQ2206884

Sven Mallach

Publication date: 26 October 2020

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

zbMATH Keywords

integer programminglayeringgraph drawing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• NP-complete scheduling problems
• Compact linearization for binary quadratic problems subject to assignment constraints
• DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY
• A Generalization of the Directed Graph Layering Problem
• Compact Layered Drawings of General Directed Graphs
• Generalized Layerings for Arbitrary and Fixed Drawing Areas

This page was built for publication: A natural quadratic approach to the generalized graph layering problem