Modifying orthogonal drawings for label placement
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1500674 (Why is no real title available?)
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
- Algorithms for area-efficient orthogonal drawing
- Algorithms for drawing graphs: An annotated bibliography
- Interactive orthogonal graph drawing
- Network flows. Theory, algorithms, and applications.
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On the complexity of the Edge Label Placement problem
- Orthogonal drawings of graphs with vertex and edge labels
Cited in
(3)
This page was built for publication: Modifying orthogonal drawings for label placement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736777)