Corpus ID: 139107933

Graph Planarity Testing with Hierarchical Embedding Constraints

@article{Liotta2019GraphPT,
  title={Graph Planarity Testing with Hierarchical Embedding Constraints},
  author={G. Liotta and I. Rutter and Alessandra Tappini},
  journal={ArXiv},
  year={2019},
  volume={abs/1904.12596}
}
  • G. Liotta, I. Rutter, Alessandra Tappini
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
  • Hierarchical embedding constraints define a set of allowed cyclic orders for the edges incident to the vertices of a graph. These constraints are expressed in terms of FPQ-trees. FPQ-trees are a variant of PQ-trees that includes F-nodes in addition to P- and to Q-nodes. An F-node represents a permutation that is fixed, i.e., it cannot be reversed. Let $G$ be a graph such that every vertex of $G$ is equipped with a set of FPQ-trees encoding hierarchical embedding constraints for its incident… CONTINUE READING
    Simultaneous FPQ-Ordering and Hybrid Planarity Testing

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 40 REFERENCES
    Testing planarity of partially embedded graphs
    84
    On-Line Planarity Testing
    218
    Computing k-Modal Embeddings of Planar Digraphs
    5
    HV-planarity: Algorithms and complexity
    3
    Graph Minors: XV. Giant Steps
    757
    Clustered planarity
    24