A flow formulation for horizontal coordinate assignment with prescribed width
From MaRDI portal
Publication:5233133
Recommendations
Cites work
- scientific article; zbMATH DE number 2084264 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1974111 (Why is no real title available?)
- scientific article; zbMATH DE number 1974127 (Why is no real title available?)
- scientific article; zbMATH DE number 2080085 (Why is no real title available?)
- scientific article; zbMATH DE number 2080102 (Why is no real title available?)
- scientific article; zbMATH DE number 1764950 (Why is no real title available?)
- A method for aggregating ordinal assessments by a majority decision rule
- AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH
- Compact layered drawings of general directed graphs
- Drawing Graphs with GLEE
- Network flows. Theory, algorithms, and applications.
- Optimal scheduling for two-processor systems
- Size- and port-aware horizontal node coordinate assignment
- Width-restricted layering of acyclic digraphs with consideration of dummy nodes
Cited in
(3)
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)