PIGALE
From MaRDI portal
Software:17575
swMATH5435MaRDI QIDQ17575FDOQ17575
Author name not available (Why is that?)
Cited In (28)
- Trémaux trees and planarity
- A branch-and-cut approach to the crossing number problem
- Drawing trees symmetrically in three dimensions
- TRÉMAUX TREES AND PLANARITY
- Geometric automorphism groups of graphs
- Linkless symmetric drawings of series parallel digraphs
- Title not available (Why is that?)
- Recent Advances in Exact Crossing Minimization (Extended Abstract)
- Non-planar core reduction of graphs
- Testing planarity of geometric automorphisms in linear time
- New analysis and computational study for the planar connected dominating set problem
- Grad and classes with bounded expansion. I: Decompositions
- A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs
- Title not available (Why is that?)
- Computational study on planar dominating set problem
- Title not available (Why is that?)
- Graph Drawing
- Title not available (Why is that?)
- Trémaux Trees and Planarity
- A polynomial-time algorithm for detecting directed axial symmetry in Hessian computational graphs
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs
- Drawing planar graphs symmetrically. II: Biconnected planar graphs
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Extraction of Multiple Kuratowski Subdivisions
- Topological morphing of planar graphs
- A force-directed algorithm for drawing directed graphs symmetrically
This page was built for software: PIGALE
