A Generalization of the Directed Graph Layering Problem

DOI10.1007/978-3-319-50106-2_16zbMath1478.68259arXiv1608.07809OpenAlexW2513101419MaRDI QIDQ2961516

Miro Spönemann, Ulf Rüegg, Thorsten Ehlers, 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/1608.07809

zbMATH Keywords

integer programmingfeedback arc setlinear arrangementlayer assignmentlayer-based layout

Mathematics Subject Classification ID

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

Related Items (3)

A Generalization of the Directed Graph Layering Problem ⋮ Compact Layered Drawings of General Directed Graphs ⋮ A natural quadratic approach to the generalized graph layering problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast and effective heuristic for the feedback arc set problem
• Scatter search for the cutwidth minimization problem
• DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY
• A Generalization of the Directed Graph Layering Problem
• In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes
• Drawing Graphs with GLEE

This page was built for publication: A Generalization of the Directed Graph Layering Problem