OGDF
From MaRDI portal
Software:16289
No author found.
Related Items (38)
Orthogonal layout with optimal face complexity ⋮ Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics ⋮ Star-struck by fixed embeddings: modern crossing number heuristics ⋮ A Benders decomposition based framework for solving cable trench problems ⋮ Multivariate topology simplification ⋮ Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems ⋮ Simplifying maximum flow computations: the effect of shrinking and good initial flows ⋮ A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints ⋮ A Distributed Multilevel Force-Directed Algorithm ⋮ Placing Arrows in Directed Graph Drawings ⋮ A Note on the Practicality of Maximal Planar Subgraph Algorithms ⋮ Offline Drawing of Dynamic Trees: Algorithmics and Document Integration ⋮ Thinning out Steiner trees: a node-based model for uniform edge costs ⋮ Unnamed Item ⋮ Partitioning planar graphs: a fast combinatorial approach for max-cut ⋮ An Experimental Study on the Ply Number of Straight-Line Drawings ⋮ An Experimental Study on the Ply Number of Straight-line Drawings ⋮ An Interactive Tool to Explore and Improve the Ply Number of Drawings ⋮ Node Overlap Removal Algorithms: an Extended Comparative Study ⋮ Stronger MIP formulations for the Steiner forest problem ⋮ Faster force-directed graph drawing with the well-separated pair decomposition ⋮ Unnamed Item ⋮ A branch-and-cut approach to the crossing number problem ⋮ Solving minimum-cost shared arborescence problems ⋮ How to Draw a Planarization ⋮ Unnamed Item ⋮ A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions ⋮ Unnamed Item ⋮ Stronger ILPs for the Graph Genus Problem. ⋮ A survey of graphs with known or bounded crossing numbers ⋮ Unnamed Item ⋮ Upward Planarization Layout ⋮ A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width ⋮ Aesthetic Discrimination of Graph Layouts ⋮ A New Framework for Hierarchical Drawings ⋮ Unnamed Item ⋮ Algorithms for the Hypergraph and the Minor Crossing Number Problems ⋮ 1-planarity testing and embedding: an experimental study
This page was built for software: OGDF
