Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products.
Sarah Spence AdamsZachary BrassConnor StokesDenise Sakai TroxellPublished in: Australas. J Comb. (2013)
Keyphrases
- graph structure
- graph representation
- graph theory
- graph matching
- weighted graph
- directed graph
- labeled graphs
- graph databases
- adjacency matrix
- graph construction
- graph mining
- graph model
- graph theoretical
- graph theoretic
- subgraph isomorphism
- graph data
- graph structures
- series parallel
- graph search
- graph clustering
- graph partitioning
- graph classification
- graph properties
- spanning tree
- random graphs
- dynamic graph
- maximum common subgraph
- graph kernels
- graph transformation
- graph isomorphism
- real world graphs
- edge weights
- directed acyclic
- structural pattern recognition
- bipartite graph
- disk resident
- graph representations
- undirected graph
- adjacency graph
- evolving graphs
- planar graphs
- inexact graph matching
- query graph
- maximum clique
- web graph
- maximum cardinality
- minimum spanning tree
- graph layout
- average degree
- finding the shortest path
- connected graphs
- maximum independent set
- bounded treewidth
- random walk
- maximal cliques
- fully connected
- connected components
- reachability queries
- proximity graph
- dense subgraphs
- social graphs
- hyper graph
- massive graphs
- quasi cliques
- relational graph
- frequent subgraphs
- neighborhood graph
- directed acyclic graph
- shortest path