Bibliographic Details
| Title: |
Simultaneous FPQ-ordering and hybrid planarity testing. |
| Authors: |
Liotta, Giuseppe1 (AUTHOR) giuseppe.liotta@unipg.it, Rutter, Ignaz2 (AUTHOR) rutter@fim.uni-passau.de, Tappini, Alessandra1 (AUTHOR) alessandra.tappini@unipg.it |
| Source: |
Theoretical Computer Science. Jun2021, Vol. 874, p59-79. 21p. |
| Subjects: |
Definitions |
| Abstract: |
We introduce and study a constrained planarity testing problem, called 1 -Fixed Constrained Planarity , and prove that this problem can be solved in quadratic time for biconnected graphs. Our solution is based on a novel definition of fixedness that makes it possible to simplify and extend known techniques about Simultaneous PQ-Ordering. We exploit this result to study different versions of the hybrid planarity testing problem. Namely, we show polynomial-time solutions for a variant of NodeTrix Planarity with fixed sides, for PolyLink Planarity , and for Clique Planarity with fixed sides. [ABSTRACT FROM AUTHOR] |
|
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
