A graph minor condition for graphs to be k-linked.
Shun-ichi MaezawaPublished in: Eur. J. Comb. (2024)
Keyphrases
- graph representation
- graph matching
- graph theory
- graph construction
- graph structure
- weighted graph
- graph databases
- directed graph
- graph mining
- adjacency matrix
- graph structures
- graph classification
- graph theoretic
- labeled graphs
- graph theoretical
- graph model
- subgraph isomorphism
- graph data
- random graphs
- bipartite graph
- graph search
- graph clustering
- graph partitioning
- series parallel
- undirected graph
- structural pattern recognition
- graph properties
- graph transformation
- graph representations
- web graph
- connected dominating set
- adjacency graph
- spanning tree
- real world graphs
- graph isomorphism
- dynamic graph
- edge weights
- disk resident
- connected graphs
- average degree
- dense subgraphs
- random walk
- maximum cardinality
- evolving graphs
- reachability queries
- finding the shortest path
- structured data
- graph edit distance
- sufficient conditions
- attributed graphs
- maximal cliques
- neighborhood graph
- graph patterns
- maximum common subgraph
- query graph
- maximum independent set
- inexact graph matching
- community discovery
- topological information
- graph kernels
- planar graphs
- fully connected
- directed acyclic
- spectral decomposition
- strongly connected
- graph drawing
- maximum clique
- pattern mining
- massive graphs
- dominating set
- graph embedding
- polynomial time complexity
- small world
- connected components