Graph minors. XXI. Graphs with unique linkages.
Neil RobertsonPaul D. SeymourPublished in: J. Comb. Theory, Ser. B (2009)
Keyphrases
- graph representation
- weighted graph
- graph matching
- graph structure
- graph theory
- graph construction
- labeled graphs
- graph databases
- adjacency matrix
- graph classification
- directed graph
- graph clustering
- graph theoretic
- graph model
- graph structures
- graph theoretical
- graph properties
- graph mining
- series parallel
- graph search
- random graphs
- graph partitioning
- undirected graph
- graph edit distance
- subgraph isomorphism
- bipartite graph
- spanning tree
- dynamic graph
- graph isomorphism
- graph drawing
- maximum common subgraph
- disk resident
- real world graphs
- neighborhood graph
- connected graphs
- graph data
- structural pattern recognition
- small world
- dense subgraphs
- graph embedding
- graph transformation
- graph representations
- maximal cliques
- graph patterns
- graph kernels
- graph layout
- maximum clique
- edge weights
- web graph
- inexact graph matching
- structured data
- evolving graphs
- polynomial time complexity
- connected components
- attributed graphs
- topological information
- connected dominating set
- maximum independent set
- planar graphs
- reachability queries
- proximity graph
- social graphs
- directed acyclic
- vertex set
- query graph
- random walk
- association graph
- massive graphs
- frequent subgraphs
- fully connected
- adjacency graph
- independent set