Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
Sarah Spence AdamsZachary BrassConnor StokesDenise Sakai TroxellPublished in: CoRR (2011)
Keyphrases
- graph representation
- graph theory
- directed graph
- graph matching
- weighted graph
- labeled graphs
- graph structure
- adjacency matrix
- graph theoretic
- graph databases
- graph construction
- graph classification
- graph model
- graph structures
- graph clustering
- graph mining
- graph partitioning
- graph search
- random graphs
- graph theoretical
- spanning tree
- graph data
- subgraph isomorphism
- graph representations
- series parallel
- bipartite graph
- structural pattern recognition
- graph isomorphism
- undirected graph
- random walk
- maximum common subgraph
- maximal cliques
- graph kernels
- graph properties
- directed acyclic
- evolving graphs
- minimum spanning tree
- dense subgraphs
- edge weights
- maximum cardinality
- finding the shortest path
- dynamic graph
- inexact graph matching
- graph transformation
- connected dominating set
- attributed graphs
- planar graphs
- topological information
- small world
- real world graphs
- social graphs
- average degree
- disk resident
- graph drawing
- neighborhood graph
- graph layout
- production processes
- connected components
- connected graphs
- graph patterns
- proximity graph
- vertex set
- community discovery
- fully connected
- reachability queries
- maximum clique
- hyper graph
- adjacency graph
- structured data