On Bus Graph Realizability
Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-Francois Preville-Ratelle, Sue Whitesides, Nuo Yu
Abstract
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1; V2;E), where the maximum degree of vertices in V2 is 4, can G be embedded on a two dimensional grid such that each vertex in V1 is drawn as a line segment along a grid line, each vertex in V2 is drawn as a point at a grid point, and each edge e = (u; v) for some u 2 V1 and v 2 V2 is drawn as a line segment connecting u and v, perpendicular to the line segment for u? We show that this problem is NP-complete, and sketch how our proof techniques can be used to show the hardness of several other related problems.
Create a lesson
Related papers
Lunar Generalizations of the Euclidean Minimum Spanning Tree in the Plane and their Expected Costs
Ondřej Draganov, Herbert Edelsbrunner, Sophie Rosenmeier et al.
Quadratic Complexity of Voronoi Diagrams in R3 for Lines in a Single Ruling of a Regulus
Eunku Park
Sequential Euclidean tree construction with exponential memory: distributional performance and worst-case guarantees
Pedro M. M. de Castro
Computing an e-net of a closed hyperbolic surface
Vincent Delecroix, Vincent Despré, Camille Lanuel et al.
On Angle-optimization and Simplification of Degree-1 Homology Representatives
Emerson G. Escolar, Yuta Shimada
Riesz Energy Subset Selection in the Euclidean Plane is NP-Hard: A Reduction from the Ising Model on Planar Cubic Graphs
Michael Emmerich