The following pages link to OGDF (Q16289):
Displaying 12 items.
- Multivariate topology simplification (Q340525) (← links)
- Simplifying maximum flow computations: the effect of shrinking and good initial flows (Q411873) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions (Q975757) (← links)
- Orthogonal layout with optimal face complexity (Q1616241) (← links)
- A Benders decomposition based framework for solving cable trench problems (Q1652230) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- Faster force-directed graph drawing with the well-separated pair decomposition (Q1736822) (← links)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
