scientific article
From MaRDI portal
Publication:3154374
zbMath1070.68124MaRDI QIDQ3154374
Md. Saidur Rahman, Takao Nishizeki
Publication date: 16 December 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (83)
Orthogonal layout with optimal face complexity ⋮ On orthogonally convex drawings of plane graphs ⋮ Star colouring of bounded degree graphs and regular graphs ⋮ HV-planarity: algorithms and complexity ⋮ On Turn-Regular Orthogonal Representations ⋮ The Complexity of Drawing a Graph in a Polygonal Region ⋮ Circular right-angle crossing drawings in linear time ⋮ AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT ⋮ Minimum-segment convex drawings of 3-connected cubic plane graphs ⋮ Greedy drawings of triangulations ⋮ The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs ⋮ Drawing Graphs with Right Angle Crossings ⋮ On some properties of doughnut graphs ⋮ The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs ⋮ On Edge-Length Ratios of Partial 2-Trees ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ An annotated bibliography on 1-planarity ⋮ The topological drawing of a graph: construction methods ⋮ Orthogonal cartograms with at most 12 corners per face ⋮ Polynomial algorithms for open plane graph and subgraph isomorphisms ⋮ Acyclic colorings of graph subdivisions revisited ⋮ Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time ⋮ Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs ⋮ k-Planar Placement and Packing of Δ-Regular Caterpillars ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ Unit-length rectangular drawings of graphs ⋮ Rectilinear planarity of partial 2-trees ⋮ Relating planar graph drawings to planar satisfiability problems ⋮ Realizability of Graphs as Triangle Cover Contact Graphs ⋮ Good spanning trees in graph drawing ⋮ Rectilinear Planarity of Partial 2-Trees ⋮ An annotated review on graph drawing and its applications ⋮ A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners ⋮ Sliding column model for t-unit bar visibility representations of graphs ⋮ On triangle cover contact graphs ⋮ Realizability of graphs as triangle cover contact graphs ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints ⋮ Pointed drawings of planar graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Point-set embeddings of trees with given partial drawings ⋮ On the obfuscation complexity of planar graphs ⋮ Recent Developments in Floorplan Representations ⋮ The complexity of drawing a graph in a polygonal region ⋮ Computing Upward Topological Book Embeddings of Upward Planar Digraphs ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ Geometric Graphs in the Plane Lattice ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ -shaped point set embeddings of high-degree plane graphs ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Untangling planar graphs from a specified vertex position-Hard cases ⋮ Small grid drawings of planar graphs with balanced partition ⋮ LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs ⋮ Drawing colored graphs with constrained vertex positions and few bends per edge ⋮ Matched drawability of graph pairs and of graph triples ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Drawing graphs with right angle crossings ⋮ Convex drawings of hierarchical planar graphs and clustered planar graphs ⋮ Generating All Triangulations of Plane Graphs (Extended Abstract) ⋮ Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) ⋮ Matched Drawability of Graph Pairs and of Graph Triples ⋮ Planar bus graphs ⋮ Parameterized complexity of graph planarity with restricted cyclic orders ⋮ Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints ⋮ Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three ⋮ Approximation algorithms for minimizing edge crossings in radial drawings ⋮ Construction of a topological drawing of the most planar subgraph of the non-planar graph ⋮ Four-Connected Spanning Subgraphs of Doughnut Graphs ⋮ Drawing slicing graphs with face areas ⋮ Triangulations with Circular Arcs ⋮ Minimum-Layer Drawings of Trees ⋮ Open rectangle-of-influence drawings of inner triangulated plane graphs ⋮ Consecutive Ones Property Testing: Cut or Swap ⋮ Orthogonal planarity testing of bounded treewidth graphs ⋮ An algorithm for constructing star-shaped drawings of plane graphs ⋮ Beyond Planar Graphs: Introduction ⋮ Algorithms for 1-Planar Graphs ⋮ Crossing Layout in Non-planar Graph Drawings ⋮ On the Edge-Length Ratio of 2-Trees ⋮ On Turn-Regular Orthogonal Representations ⋮ Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time ⋮ Force-directed layout of order diagrams using dimensional reduction
This page was built for publication:
