Experimental comparison of PC-trees and PQ-trees

DOI10.1145/3611653MaRDI QIDQ6579776zbMATH OpenFDO

Authors Simon D. Fink, Ignaz Rutter

Publication date 26 July 2024

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

zbMATH Keywords

experimental evaluationPQ-treePC-treeconsecutive ones

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A new planarity test
• Graph Simultaneous Embedding Tool, GraphSET
• PC trees and circular-ones arrangements.
• Partial and Constrained Level Planarity
• Planarity algorithms via PQ-trees (extended abstract)
• Simultaneous PQ-ordering with applications to constrained embedding problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

This page was built for publication: Experimental comparison of PC-trees and PQ-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579776)