Relating threshold tolerance graphs to other graph classes.
Tiziana CalamoneriBlerina SinaimeriPublished in: ICTCS (2014)
Keyphrases
- graph representation
- graph theory
- graph structure
- graph matching
- weighted graph
- labeled graphs
- directed graph
- adjacency matrix
- graph construction
- graph mining
- bounded degree
- subgraph isomorphism
- graph databases
- graph theoretic
- graph clustering
- graph structures
- graph classification
- series parallel
- graph theoretical
- directed acyclic
- graph model
- graph partitioning
- graph properties
- graph search
- undirected graph
- random graphs
- graph isomorphism
- graph data
- graph representations
- spanning tree
- web graph
- minimum spanning tree
- proximity graph
- finding the shortest path
- maximum clique
- bipartite graph
- connected dominating set
- maximum independent set
- dynamic graph
- social graphs
- graph transformation
- graph kernels
- structured data
- association graph
- maximum common subgraph
- graph drawing
- disk resident
- average degree
- small world
- massive graphs
- inexact graph matching
- edge weights
- dense subgraphs
- spectral decomposition
- evolving graphs
- shortest path
- adjacency graph
- social networks
- graph patterns
- random walk
- planar graphs
- attributed graphs
- bounded treewidth
- graph layout
- structural pattern recognition
- real world graphs
- query graph
- strongly connected
- graph embedding
- fully connected
- equivalence classes
- graphical models
- reachability queries
- hyper graph
- maximal cliques
- neighborhood graph