Graph Searching on Some Subclasses of Chordal Graphs.
Sheng-Lung PengChuan Yi TangMing-Tat KoChin-Wen HoTsan-sheng HsuPublished in: Algorithmica (2000)
Keyphrases
- undirected graph
- graph theory
- graph representation
- graph structure
- directed graph
- graph theoretical
- adjacency matrix
- graph theoretic
- graph databases
- weighted graph
- labeled graphs
- graph matching
- graph structures
- graph construction
- random graphs
- graph model
- graph partitioning
- graph mining
- series parallel
- graph properties
- subgraph isomorphism
- graph search
- spanning tree
- graph classification
- bipartite graph
- graph data
- graph clustering
- graph isomorphism
- disk resident
- structural pattern recognition
- directed acyclic
- neighborhood graph
- evolving graphs
- connected components
- graph transformation
- maximum clique
- maximum common subgraph
- social graphs
- graph kernels
- maximum cardinality
- inexact graph matching
- graph layout
- finding the shortest path
- structured data
- graph representations
- random walk
- edge weights
- vertex set
- dense subgraphs
- dynamic graph
- association graph
- connected graphs
- directed acyclic graph
- web graph
- proximity graph
- reachability queries
- minimum spanning tree
- graph patterns
- attributed graphs
- topological information
- planar graphs
- average degree
- real world graphs
- bounded degree
- adjacency graph
- maximal cliques
- quasi cliques
- community discovery
- approximation algorithms
- strongly connected
- connected dominating set
- small world
- bounded treewidth
- minimum cost
- complex networks