Poset graphs and the lattice of graph annihilators.
John D. LaGrangeKyle A. RoyPublished in: Discret. Math. (2013)
Keyphrases
- graph representation
- graph theory
- weighted graph
- graph structure
- directed graph
- adjacency matrix
- graph construction
- graph matching
- labeled graphs
- graph mining
- graph clustering
- graph structures
- graph theoretic
- graph model
- graph databases
- graph classification
- graph partitioning
- graph properties
- graph search
- graph isomorphism
- graph theoretical
- subgraph isomorphism
- bipartite graph
- graph representations
- random graphs
- graph transformation
- graph data
- structural pattern recognition
- undirected graph
- spanning tree
- minimum spanning tree
- reachability queries
- graph patterns
- series parallel
- neighborhood graph
- dense subgraphs
- graph drawing
- web graph
- finding the shortest path
- attributed graphs
- edge weights
- evolving graphs
- inexact graph matching
- connected dominating set
- directed acyclic
- disk resident
- connected graphs
- maximum clique
- adjacency graph
- maximum common subgraph
- association graph
- dynamic graph
- graph kernels
- real world graphs
- query graph
- planar graphs
- maximal cliques
- massive graphs
- shortest path
- maximum cardinality
- graph layout
- social graphs
- small world
- topological information
- concept lattice
- connected components
- pattern mining
- structured data
- attributed relational graph
- average degree