Crossing minimization and layouts of directed hypergraphs with port constraints

DOI10.1007/978-3-642-18469-7_13zbMATH Open1314.68223OpenAlexW1602765982WikidataQ56977099 ScholiaQ56977099MaRDI QIDQ3073668FDOQ3073668

Authors: Markus Chimani, Carsten Gutwenger, Petra Mutzel, Miro Spönemann, Hoi-Ming Wong 

Publication date: 11 February 2011

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18469-7_13

Recommendations

• Hypergraph and minor crossing number problems
• Layer-free upward crossing minimization
• Crossing-constrained hierarchical drawings
• scientific article; zbMATH DE number 1796980
• Upward planarization layout

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65)

Cited In (7)

• A fast path relinking algorithm for the min-max edge crossing problem
• Title not available (Why is that?)
• Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
• Layered drawing of undirected graphs with generalized port constraints
• Tabu search for min-max edge crossing in graphs
• Hypergraph and minor crossing number problems
• How to draw a hypergraph

This page was built for publication: Crossing minimization and layouts of directed hypergraphs with port constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073668)