Compact Layered Drawings of General Directed Graphs

DOI10.1007/978-3-319-50106-2_17zbMath1478.68245DBLPconf/gd/JabrayilovMMRH16arXiv1609.01755OpenAlexW2510840210WikidataQ56976936 ScholiaQ56976936MaRDI QIDQ2961517

Adalat Jabrayilov, Petra Mutzel, Ulf Rüegg, Sven Mallach, Reinhard von Hanxleden

Publication date: 21 February 2017

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

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

zbMATH Keywords

mixed integer programminglayer assignmentlayer-based layout

Mathematics Subject Classification ID

Mixed integer programming (90C11) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays ⋮ Compact Layered Drawings of General Directed Graphs ⋮ A natural quadratic approach to the generalized graph layering problem ⋮ A flow formulation for horizontal coordinate assignment with prescribed width ⋮ A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast and effective heuristic for the feedback arc set problem
• Optimal scheduling for two-processor systems
• A Generalization of the Directed Graph Layering Problem
• Compact Layered Drawings of General Directed Graphs
• In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes
• Drawing Graphs with GLEE
• The Eigenvalues of a Graph and Its Chromatic Number

This page was built for publication: Compact Layered Drawings of General Directed Graphs