ON EMBEDDING A GRAPH ON TWO SETS OF POINTS

DOI10.1142/S0129054106004273zbMath1100.68078OpenAlexW2114131950WikidataQ62042587 ScholiaQ62042587MaRDI QIDQ5493895

Emilio Di Giacomo, Giuseppe Liotta, Francesco Trotta

Publication date: 16 October 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054106004273

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES, Alternating paths and cycles of minimum length, 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, Point-set embeddings of trees with given partial drawings, Colored Point-Set Embeddings of Acyclic Graphs, Drawing colored graphs on colored points, Drawing colored graphs with constrained vertex positions and few bends per edge, CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS, Constrained Point-Set Embeddability of Planar Graphs, 2-colored point-set embeddings of partial 2-trees, 2-colored point-set embeddings of partial 2-trees, Upward Book Embeddings of st-Graphs

Cites Work

• Simple alternating path problem
• On the thickness of graphs of given degree
• Planar graphs: Theory and algorithms
• Straight-line embeddings of two rooted trees in the plane
• Bipartite embeddings of trees in the plane
• Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph
• The rooted tree embedding problem into points in the plane
• On a straight-line embedding problem of graphs
• Straight line embeddings of rooted star forests in the plane
• A Visibility Representation for Graphs in Three Dimensions
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
• Drawing graphs. Methods and models
• Embedding planar graphs at fixed vertex locations