OGDF
From MaRDI portal
Cited in
(62)- Graphviz
- yFiles
- SMIL
- Orthogonal layout with optimal face complexity
- SteinLib
- A Benders decomposition based framework for solving cable trench problems
- GDToolkit
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
- Blossom IV
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Faster force-directed graph drawing with the well-separated pair decomposition
- Solving minimum-cost shared arborescence problems
- PIGALE
- Moca
- 1-planarity testing and embedding: an experimental study
- Star-struck by fixed embeddings: modern crossing number heuristics
- GraphSET
- Stronger MIP formulations for the Steiner forest problem
- Algorithm 447
- apfloat
- PseudoViewer3
- jViz.Rna
- 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
- An experimental study on the ply number of straight-line drawings
- AGORA
- Handbook of graph drawing and visualization
- NodeTrix
- Multivariate topology simplification
- KADABRA
- Circos
- Ply
- Simplifying maximum flow computations: the effect of shrinking and good initial flows
- Nevada
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- stprbh
- An experimental study on the ply number of straight-line drawings
- An Interactive Tool to Explore and Improve the Ply Number of Drawings
- Visual DSD
- Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast
- Stronger ILPs for the Graph Genus Problem.
- scientific article; zbMATH DE number 7525513 (Why is no real title available?)
- scientific article; zbMATH DE number 7236457 (Why is no real title available?)
- A survey of graphs with known or bounded crossing numbers
- Exact algorithms for the maximum planar subgraph problem: new models and experiments
- Node overlap removal algorithms: an extended comparative study
- A flow formulation for horizontal coordinate assignment with prescribed width
- Aesthetic Discrimination of Graph Layouts
- A new framework for hierarchical drawings
- How to draw a planarization
- Hypergraph and minor crossing number problems
- scientific article; zbMATH DE number 6776481 (Why is no real title available?)
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
- Upward planarization layout
- PQ-Tree
- JGraphEd
- McSparse
- A branch-and-cut approach to the crossing number problem
- A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
This page was built for software: OGDF
