Convexities in Some Special Graph Classes - New Results in AT-free Graphs and Beyond.
Wing-Kai HonTon KloksHsiang-Hsuan LiuHung-Lung WangYue-Li WangPublished in: CoRR (2015)
Keyphrases
- graph structure
- graph representation
- graph theory
- directed graph
- labeled graphs
- graph matching
- graph theoretic
- graph construction
- adjacency matrix
- bounded degree
- weighted graph
- graph databases
- graph mining
- graph model
- graph properties
- graph structures
- graph classification
- graph clustering
- bipartite graph
- graph search
- random graphs
- directed acyclic
- graph data
- subgraph isomorphism
- graph theoretical
- graph kernels
- graph partitioning
- series parallel
- graph representations
- average degree
- structural pattern recognition
- spanning tree
- minimum spanning tree
- random walk
- reachability queries
- maximum common subgraph
- edge weights
- undirected graph
- equivalence classes
- query graph
- graph isomorphism
- disk resident
- graph transformation
- planar graphs
- maximum cardinality
- spectral decomposition
- graph drawing
- maximum clique
- attributed graphs
- web graph
- graph layout
- graph embedding
- connected graphs
- finding the shortest path
- evolving graphs
- connected dominating set
- adjacency graph
- association graph
- topological information
- graphical models
- maximal cliques
- structured data
- graph patterns
- directed acyclic graph
- semi supervised
- polynomial time complexity
- maximum independent set
- np complete
- small world
- massive graphs
- frequent subgraphs
- dense subgraphs
- bounded treewidth
- proximity graph
- vertex set