A linear-time algorithm for isomorphism of a subclass of chordal graphs

DOI10.1016/0020-0190(92)90254-SzbMath0764.68136OpenAlexW2013862018MaRDI QIDQ1195864

N. Ch. Veeraraghavulu, P. Sreenivasa Kumar, C. E. Veni Madhavan

Publication date: 4 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90254-s

zbMATH Keywords

design of algorithmschordal graphsgraph isomorphism problemlinear- time algorithmHamiltonian 2-sepchordal graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Clique tree generalization and new subclasses of chordal graphs ⋮ Minimal vertex separators of chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• Clique tree generalization and new subclasses of chordal graphs
• A V log V algorithm for isomorphism of triconnected planar graphs
• Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs
• A Linear Time Algorithm for Deciding Interval Graph Isomorphism

This page was built for publication: A linear-time algorithm for isomorphism of a subclass of chordal graphs