Drawing colored graphs with constrained vertex positions and few bends per edge
From MaRDI portal
Publication:973017
DOI10.1007/s00453-008-9255-2zbMath1203.68123OpenAlexW2034216584WikidataQ62042519 ScholiaQ62042519MaRDI QIDQ973017
Francesco Trotta, Emilio Di Giacomo, Giuseppe Liotta
Publication date: 28 May 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9255-2
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Quasi-upward planar drawings with minimum curve complexity ⋮ Alternating paths and cycles of minimum length ⋮ Orthogeodesic point-set embedding of trees ⋮ Orthogeodesic Point-Set Embedding of Trees ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Colored anchored visibility representations in 2D and 3D space ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Colored Point-Set Embeddings of Acyclic Graphs ⋮ CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ Upward Book Embeddings of st-Graphs ⋮ Planar drawings of fixed-mobile bigraphs ⋮ THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Curve-constrained drawings of planar graphs
- On the thickness of graphs of given degree
- Book embeddability of series-parallel digraphs
- Partitioned Drawings
- Drawing Colored Graphs on Colored Points
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Graph Drawing and Applications for Software and Knowledge Engineers
- Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
- k-colored Point-set Embeddability of Outerplanar Graphs
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- Drawing graphs. Methods and models
- Embedding planar graphs at fixed vertex locations