scientific article; zbMATH DE number 2080088

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1984/19840077.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items

Outer 1-planar graphs ⋮ Planar straight-line realizations of 2-trees with prescribed edge lengths ⋮ Linear-time recognition of map graphs with outerplanar witness ⋮ Classes of cycle bases ⋮ 3-connected reduction for regular graph covers ⋮ On the Hardness and Approximability of Planar Biconnectivity Augmentation ⋮ Upward planar drawings with two slopes ⋮ On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ Planar Embeddings with Small and Uniform Faces ⋮ On maximum common subgraph problems in series-parallel graphs ⋮ Universal slope sets for 1-bend planar drawings ⋮ Separator-based data reduction for signed graph balancing ⋮ Jordan-like characterization of automorphism groups of planar graphs ⋮ Bitonic $st$-orderings for upward planar graphs: splits and bends in the variable embedding scenario ⋮ Upward book embeddability of $st$-graphs: complexity and algorithms ⋮ Inserting Multiple Edges into a Planar Graph ⋮ Synchronized Planarity with Applications to Constrained Planarity Problems ⋮ Rectilinear planarity of partial 2-trees ⋮ Testing upward planarity of partial 2-trees ⋮ The Rique-number of graphs ⋮ Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs ⋮ Rectilinear Planarity of Partial 2-Trees ⋮ 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 ⋮ On 2-strong connectivity orientations of mixed graphs and related problems ⋮ A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs ⋮ Recognizing optimal 1-planar graphs in linear time ⋮ $\mathsf{T}$-shape visibility representations of 1-planar graphs ⋮ An SPQR-tree-like embedding representation for upward planarity ⋮ Drawing partial 2-trees with few slopes ⋮ Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph ⋮ Unnamed Item ⋮ Minor-Closed Graph Classes with Bounded Layered Pathwidth ⋮ Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra ⋮ Certifying algorithms ⋮ A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing ⋮ Bend-minimum orthogonal drawings in quadratic time ⋮ A linear-time algorithm for testing full outer-2-planarity ⋮ Orthogonal graph drawing with flexibility constraints ⋮ Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY ⋮ Decremental SPQR-trees for Planar Graphs ⋮ Orthogonal graph drawing with inflexible edges ⋮ A branch-and-cut approach to the crossing number problem ⋮ Certifying 3-edge-connectivity ⋮ Simpler algorithms for testing two-page book embedding of partitioned graphs ⋮ Simultaneous embedding: edge orderings, relative positions, cutvertices ⋮ Relaxing the constraints of clustered planarity ⋮ Unnamed Item ⋮ A tighter insertion-based approximation of the crossing number ⋮ Unnamed Item ⋮ Hierarchical partial planarity ⋮ Planar bus graphs ⋮ The partial visibility representation extension problem ⋮ Turing kernelization for finding long paths and cycles in restricted graph classes ⋮ Graph isomorphism restricted by lists ⋮ Optimization and Recognition for K 5-minor Free Graphs in Linear Time ⋮ Non-planar core reduction of graphs ⋮ Advances in the Planarization Method: Effective Multiple Edge Insertions ⋮ Testing planarity of geometric automorphisms in linear time ⋮ Approximation Algorithms for Facial Cycles in Planar Embeddings ⋮ Mondshein Sequences (a.k.a. (2,1)-Orders) ⋮ Connectivity of workflow nets: The foundations of stepwise verification ⋮ An algorithm for constructing star-shaped drawings of plane graphs ⋮ Faster algorithms for shortest path and network flow based on graph decomposition ⋮ $$\textit{\textbf{k}}$$-Planar Graphs ⋮ Fan-Planar Graphs ⋮ Maximum cycle packing using SPR-trees ⋮ Tractable minor-free generalization of planar zero-field Ising models ⋮ Percolation thresholds for robust network connectivity ⋮ Monotone drawings of graphs with fixed embedding ⋮ Disconnectivity and relative positions in simultaneous embeddings

Uses Software

LEDA

This page was built for publication: