scientific article; zbMATH DE number 2080088
From MaRDI portal
Publication:4472293
zbMATH Open1043.68621MaRDI QIDQ4472293FDOQ4472293
Authors: 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
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (79)
- Universal slope sets for 1-bend planar drawings
- A branch-and-cut approach to the crossing number problem
- A linear-time algorithm for testing outer-1-planarity
- Bend-minimum orthogonal drawings in quadratic time
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time
- An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs
- Fan-planar graphs
- Relaxing the constraints of clustered planarity
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Recognizing optimal 1-planar graphs in linear time
- Monotone drawings of graphs with fixed embedding
- A linear-time algorithm for testing full outer-2-planarity
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
- Outer 1-planar graphs
- Title not available (Why is that?)
- Planar bus graphs
- VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
- Orthogonal graph drawing with flexibility constraints
- Mondshein sequences (a.k.a. (2,1)-orders)
- Orthogonal graph drawing with inflexible edges
- Decremental SPQR-trees for Planar Graphs
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
- Disconnectivity and relative positions in simultaneous embeddings
- Non-planar core reduction of graphs
- Faster algorithms for shortest path and network flow based on graph decomposition
- Title not available (Why is that?)
- Approximation Algorithms for Facial Cycles in Planar Embeddings
- Title not available (Why is that?)
- Planar embeddings with small and uniform faces
- An algorithm for constructing star-shaped drawings of plane graphs
- Testing planarity of geometric automorphisms in linear time
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions
- Linear-time recognition of map graphs with outerplanar witness
- The Rique-number of graphs
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Classes of cycle bases
- 3-connected reduction for regular graph covers
- Connectivity of workflow nets: The foundations of stepwise verification
- Upward planar drawings with two slopes
- On maximum common subgraph problems in series-parallel graphs
- A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs
- Certifying algorithms
- Separator-based data reduction for signed graph balancing
- Percolation thresholds for robust network connectivity
- On the Hardness and Approximability of Planar Biconnectivity Augmentation
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
- \(k\)-planar graphs
- On 2-strong connectivity orientations of mixed graphs and related problems
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- Jordan-like characterization of automorphism groups of planar graphs
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- Title not available (Why is that?)
- Drawing partial 2-trees with few slopes
- An SPQR-tree-like embedding representation for upward planarity
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Title not available (Why is that?)
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Rectilinear Planarity of Partial 2-Trees
- Enumerating combinatorial resultant trees
- Tractable minor-free generalization of planar zero-field Ising models
- Maintaining triconnected components under node expansion
- A more accurate view of the flat wall theorem
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario
- Maximum cycle packing using SPR-trees
- On upward-planar L-drawings of graphs
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- On the parameterized complexity of bend-minimum orthogonal planarity
- On the parameterized complexity of bend-minimum orthogonal planarity
- Synchronized Planarity with Applications to Constrained Planarity Problems
- Unit-length rectangular drawings of graphs
- Graph isomorphism restricted by lists
- Inserting Multiple Edges into a Planar Graph
- Advances in the planarization method: effective multiple edge insertions
- Rectilinear planarity of partial 2-trees
- Testing upward planarity of partial 2-trees
- Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472293)
