Isomorphism of graph classes related to the circular-ones property
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum,, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme L. Szwarcfiter
TL;DR
This paper presents a linear-time algorithm for testing isomorphism between 0-1 matrices with the circular-ones property, enabling efficient isomorphism checks for several related graph classes.
Contribution
The authors develop a linear-time isomorphism algorithm for matrices with the circular-ones property, extending to multiple related graph classes.
Findings
Linear-time isomorphism algorithm for circular-ones matrices
Efficient isomorphism algorithms for Helly circular-arc graphs and related classes
Improved computational complexity for graph class isomorphism problems
Abstract
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, \Gamma-circular-arc graphs, proper circular-arc graphs and convex-round graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Interconnection Networks and Systems · Graph theory and applications