Graphs and algorithms
Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
On Triangulating Planar Graphs under the Four-Connectivity Constraint
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
Two Algorithms for Finding Rectangular Duals of Planar Graphs
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
Lai and Leinwand have shown that an arbitrary plane (i.e., embedded planar) graph G can be transformed, bya dding crossover vertices, into a new plane graph G′ admitting a rectangular dual. Moreover, theyc onjectured that finding a minimum set of such crossover vertices is an NP-complete problem. In this paper it is shown that the above problem can be resolved in polynomial time by reducing it to a graph covering problem, and an efficient algorithm for finding a minimum set of edges on which to insert the crossover vertices is also presented.