Drawing graphs. Methods and models
From MaRDI portal
Publication:5952489
DOI10.1007/3-540-44969-8zbMath0977.68644OpenAlexW4253380179WikidataQ55966841 ScholiaQ55966841MaRDI QIDQ5952489
No author found.
Publication date: 14 January 2002
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-44969-8
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Computing methodologies and applications (68U99)
Related Items (89)
Orthogonal layout with optimal face complexity ⋮ A multi-dimensional approach to force-directed layouts of large graphs ⋮ Recognizing and drawing IC-planar graphs ⋮ HV-planarity: algorithms and complexity ⋮ On Turn-Regular Orthogonal Representations ⋮ On multi-objective optimization aided drawing of special graphs ⋮ Heuristics for the constrained incremental graph drawing problem ⋮ Drawing Graphs with Right Angle Crossings ⋮ Computing straight-line 3D grid drawings of graphs in linear volume ⋮ On simultaneous planar graph embeddings ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ Coordinate Assignment for Cyclic Level Graphs ⋮ How traders influence their neighbours: modelling social evolutionary processes and peer effects in agricultural trade networks ⋮ An annotated bibliography on 1-planarity ⋮ The topological drawing of a graph: construction methods ⋮ Area-efficient planar straight-line drawings of outerplanar graphs ⋮ Drawing \(c\)-planar biconnected clustered graphs ⋮ k-Planar Placement and Packing of Δ-Regular Caterpillars ⋮ Complexity analysis of balloon drawing for rooted trees ⋮ Rectilinear planarity of partial 2-trees ⋮ Drawing a tree as a minimum spanning tree approximation ⋮ Variable neighborhood scatter search for the incremental graph drawing problem ⋮ $st$-Orientations with Few Transitive Edges ⋮ Rectilinear Planarity of Partial 2-Trees ⋮ On the Density of Non-simple 3-Planar Graphs ⋮ Parameterized approaches to orthogonal compaction ⋮ On the 2-layer window width minimization problem ⋮ Straight-line rectangular drawings of clustered graphs ⋮ A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners ⋮ Fast layout computation of clustered networks: algorithmic advances and experimental analysis ⋮ Right angle crossing graphs and 1-planarity ⋮ A fast successive over-relaxation algorithm for force-directed network graph drawing ⋮ ChordLink: a new hybrid visualization model ⋮ Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints ⋮ From simulated annealing to stochastic continuation: a new trend in combinatorial optimization ⋮ Cycle bases in graphs characterization, algorithms, complexity, and applications ⋮ Point-set embeddings of trees with given partial drawings ⋮ Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ Algorithms and bounds for drawing directed graphs ⋮ Computing Upward Topological Book Embeddings of Upward Planar Digraphs ⋮ Constrained Simultaneous and Near-Simultaneous Embeddings ⋮ Approximating the fixed linear crossing number ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area ⋮ Tabu search tutorial. A graph drawing application ⋮ Rejoinder on: ``Tabu search tutorial. A graph drawing application ⋮ Data-driven graph drawing techniques with applications for conveyor systems ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Maximum upward planar subgraphs of embedded planar digraphs ⋮ Radial drawings of graphs: geometric constraints and trade-offs ⋮ PATHWIDTH AND LAYERED DRAWINGS OF TREES ⋮ Drawing colored graphs on colored points ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Crossing minimization in extended level drawings of graphs ⋮ Boundary labeling with octilinear leaders ⋮ 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 ⋮ Curve-constrained drawings of planar graphs ⋮ Matched drawability of graph pairs and of graph triples ⋮ Drawing graphs with right angle crossings ⋮ Convex drawings of hierarchical planar graphs and clustered planar graphs ⋮ Upward three-dimensional grid drawings of graphs ⋮ Matched Drawability of Graph Pairs and of Graph Triples ⋮ Planar bus graphs ⋮ Queue layouts of planar 3-trees ⋮ The Binary Stress Model for Graph Drawing ⋮ Embeddability Problems for Upward Planar Digraphs ⋮ Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints ⋮ Cyclic Leveling of Directed Graphs ⋮ Approximation algorithms for minimizing edge crossings in radial drawings ⋮ Cyclic Level Planarity Testing and Embedding ⋮ Line Crossing Minimization on Metro Maps ⋮ The Straight-Line RAC Drawing Problem Is NP-Hard ⋮ Drawing slicing graphs with face areas ⋮ On the complexity of crossings in permutations ⋮ Review of statistical network analysis: models, algorithms, and software ⋮ A New Framework for Hierarchical Drawings ⋮ An algorithm for constructing star-shaped drawings of plane graphs ⋮ ON EMBEDDING A GRAPH ON TWO SETS OF POINTS ⋮ CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES ⋮ AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING ⋮ Planar drawings of fixed-mobile bigraphs ⋮ Orthogonal drawings of graphs with vertex and edge labels ⋮ One-dimensional layout optimization, with applications to graph drawing by axis separation ⋮ HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs ⋮ On Turn-Regular Orthogonal Representations ⋮ Discussion to: Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and F.C. Stingo ⋮ Drawing graphs by eigenvectors: theory and practice
This page was built for publication: Drawing graphs. Methods and models
