Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number

Authors:
Takayuki Nagoya
Affiliations:
-
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2001

Citing 6
Cited 0

Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

Journal of Algorithms
The isomorphism problem for directed path graphs and for rooted directed path graphs

Journal of Algorithms
A Linear Time Algorithm for Deciding Interval Graph Isomorphism

Journal of the ACM (JACM)
Isomorphism of graphs with bounded eigenvalue multiplicity

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Algorithmic aspects of vertex elimination

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the following problem: given two graphs G and H and an isomorphism ϕ between an induced subgraph of G and an induced subgraph of H, compute the number of isomorphisms between G and H that doesn't contradict to ϕ. We show that this problem can be solved in O((k + 1)!n3) time when input graphs are restricted to chordal graphs with clique number at most k + 1. To show this, we first show that the tree model of a chordal graph can be uniquely constructed except for the ordering of children of each node in O(n3) time. Then, we show that the number of isomorphisms between G and H that doesn't contradict to ϕ can be efficiently computed by use of the tree model.