A PQSM-tree data structure captures all normalized models of a circular-arc graph and yields a linear-time canonization and isomorphism algorithm.
Deciding circular-arc graph isomorphism in para meterized logspace
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
A PQSM-tree data structure captures all normalized models of a circular-arc graph and yields a linear-time canonization and isomorphism algorithm.