Publication:4472293
From MaRDI portal
zbMath1043.68621MaRDI QIDQ4472293
Petra Mutzel, Carsten Gutwenger
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
Minor-Closed Graph Classes with Bounded Layered Pathwidth, VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY, Faster algorithms for shortest path and network flow based on graph decomposition, On the Hardness and Approximability of Planar Biconnectivity Augmentation, Optimization and Recognition for K 5-minor Free Graphs in Linear Time, Hierarchical partial planarity, Graph isomorphism restricted by lists, Advances in the Planarization Method: Effective Multiple Edge Insertions, Tractable minor-free generalization of planar zero-field Ising models, Percolation thresholds for robust network connectivity, Outer 1-planar graphs, 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, A linear-time algorithm for testing outer-1-planarity, Certifying 3-edge-connectivity, Separator-based data reduction for signed graph balancing, Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra, Orthogonal graph drawing with inflexible edges, Planar bus graphs, The partial visibility representation extension problem, Turing kernelization for finding long paths and cycles in restricted graph classes, 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, Linear-time recognition of map graphs with outerplanar witness, 3-connected reduction for regular graph covers, On maximum common subgraph problems in series-parallel graphs, Recognizing optimal 1-planar graphs in linear time, \(\mathsf{T}\)-shape visibility representations of 1-planar graphs, Bend-minimum orthogonal drawings in quadratic time, A linear-time algorithm for testing full outer-2-planarity, Simpler algorithms for testing two-page book embedding of partitioned graphs, Simultaneous embedding: edge orderings, relative positions, cutvertices, A tighter insertion-based approximation of the crossing number, An SPQR-tree-like embedding representation for upward planarity, Relaxing the constraints of clustered planarity, Monotone drawings of graphs with fixed embedding, Disconnectivity and relative positions in simultaneous embeddings, On the recognition of fan-planar and maximal outer-fan-planar graphs, Universal slope sets for 1-bend planar drawings, 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, Mondshein Sequences (a.k.a. (2,1)-Orders), Planar Embeddings with Small and Uniform Faces, Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree
Uses Software
