Publication:4472293
From MaRDI portal
zbMath1043.68621MaRDI QIDQ4472293
Carsten Gutwenger, Petra Mutzel
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1984/19840077.htm
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
68P05: Data structures
Related Items
On the Hardness and Approximability of Planar Biconnectivity Augmentation, Optimization and Recognition for K 5-minor Free Graphs in Linear Time, Advances in the Planarization Method: Effective Multiple Edge Insertions, Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph, Certifying algorithms, A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing, Orthogonal graph drawing with flexibility constraints, Separator-based data reduction for signed graph balancing, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, Connectivity of workflow nets: The foundations of stepwise verification, Classes of cycle bases, A branch-and-cut approach to the crossing number problem, Non-planar core reduction of graphs, Testing planarity of geometric automorphisms in linear time, An algorithm for constructing star-shaped drawings of plane graphs, A tighter insertion-based approximation of the crossing number, Relaxing the constraints of clustered planarity, A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners, An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs, Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree
Uses Software
