Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions.
Manoj ChangatFerdoos Hossein NezhadNarayanan NarayananPublished in: CALDAM (2016)
Keyphrases
- axiomatic characterization
- graph representation
- graph theory
- graph structure
- graph databases
- graph theoretic
- graph matching
- directed graph
- weighted graph
- graph construction
- graph mining
- graph structures
- graph theoretical
- random graphs
- graph model
- adjacency matrix
- graph data
- graph classification
- subgraph isomorphism
- labeled graphs
- spanning tree
- graph partitioning
- graph search
- graph clustering
- graph properties
- graph isomorphism
- bipartite graph
- connected graphs
- undirected graph
- graph kernels
- relational structures
- structural pattern recognition
- maximum common subgraph
- series parallel
- directed acyclic
- reachability queries
- attributed graphs
- minimum spanning tree
- graph transformation
- graph representations
- dynamic graph
- planar graphs
- maximum cardinality
- structured data
- random walk
- disk resident
- graph layout
- connected dominating set
- bounded treewidth
- small world
- maximal cliques
- association graph
- conditional independence
- social graphs
- average degree
- inexact graph matching
- graph drawing
- web graph
- adjacency graph
- graphical models
- dense subgraphs
- finding the shortest path
- edge weights
- quasi cliques
- massive graphs
- neighborhood graph
- graph embedding
- community discovery
- bounded degree
- proximity graph
- vertex set
- maximum clique
- real world graphs