Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number.
Takayuki NagoyaPublished in: ISAAC (2001)
Keyphrases
- undirected graph
- graph theoretic
- graph properties
- random graphs
- connected graphs
- independent set
- subgraph isomorphism
- graph theory
- bipartite graph
- polynomial time complexity
- graph mining
- graph matching
- directed graph
- random walk
- graph model
- directed acyclic graph
- graph structure
- graph kernels
- fully connected
- maximal cliques