A flow formulation for horizontal coordinate assignment with prescribed width
DOI10.7155/JGAA.00500zbMATH Open1419.05147OpenAlexW2972400760WikidataQ127281435 ScholiaQ127281435MaRDI QIDQ5233133FDOQ5233133
Authors: Michael Jünger, Petra Mutzel, Christiane Spisla 
Publication date: 16 September 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00500
Recommendations
Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Drawing Graphs with GLEE
- Optimal scheduling for two-processor systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A method for aggregating ordinal assessments by a majority decision rule
- AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH
- Width-restricted layering of acyclic digraphs with consideration of dummy nodes
- Title not available (Why is that?)
- Compact layered drawings of general directed graphs
- Title not available (Why is that?)
- Size- and port-aware horizontal node coordinate assignment
Cited In (3)
Uses Software
This page was built for publication: A flow formulation for horizontal coordinate assignment with prescribed width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233133)
