View in EDS

Simultaneous FPQ-ordering and hybrid planarity testing.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 150411644
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Simultaneous FPQ-ordering and hybrid planarity testing.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Liotta%2C+Giuseppe%22">Liotta, Giuseppe</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> giuseppe.liotta@unipg.it</i><br /><searchLink fieldCode="AR" term="%22Rutter%2C+Ignaz%22">Rutter, Ignaz</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> rutter@fim.uni-passau.de</i><br /><searchLink fieldCode="AR" term="%22Tappini%2C+Alessandra%22">Tappini, Alessandra</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> alessandra.tappini@unipg.it</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Theoretical+Computer+Science%22">Theoretical Computer Science</searchLink>. Jun2021, Vol. 874, p59-79. 21p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Definitions%22">Definitions</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=150411644
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.tcs.2021.05.012
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 59
    Subjects:
      – SubjectFull: Definitions
        Type: general
    Titles:
      – TitleFull: Simultaneous FPQ-ordering and hybrid planarity testing.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Liotta, Giuseppe
      – PersonEntity:
          Name:
            NameFull: Rutter, Ignaz
      – PersonEntity:
          Name:
            NameFull: Tappini, Alessandra
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 12
              M: 06
              Text: Jun2021
              Type: published
              Y: 2021
          Identifiers:
            – Type: issn-print
              Value: 03043975
          Numbering:
            – Type: volume
              Value: 874
          Titles:
            – TitleFull: Theoretical Computer Science
              Type: main
ResultId 1