Kernelization of Graph Hamiltonicity: Proper H-Graphs.
Steven ChaplickFedor V. FominPetr A. GolovachDusan KnopPeter ZemanPublished in: SIAM J. Discret. Math. (2021)
Keyphrases
- graph theory
- graph structure
- graph representation
- directed graph
- graph theoretic
- weighted graph
- labeled graphs
- graph matching
- graph construction
- graph databases
- graph properties
- graph mining
- graph classification
- adjacency matrix
- graph structures
- graph search
- subgraph isomorphism
- graph data
- graph clustering
- series parallel
- graph model
- structural pattern recognition
- graph theoretical
- graph partitioning
- spanning tree
- bipartite graph
- random graphs
- undirected graph
- graph transformation
- graph representations
- graph isomorphism
- graph kernels
- maximum clique
- edge weights
- graph patterns
- directed acyclic
- dynamic graph
- adjacency graph
- maximum independent set
- graph edit distance
- connected graphs
- disk resident
- minimum spanning tree
- social graphs
- fully connected
- spectral decomposition
- dense subgraphs
- query graph
- evolving graphs
- maximum common subgraph
- maximum cardinality
- topological information
- graph embedding
- inexact graph matching
- graph drawing
- directed acyclic graph
- structured data
- massive graphs
- connected dominating set
- graph layout
- proximity graph
- reachability queries
- real world graphs
- association graph
- frequent subgraphs
- web graph
- pattern mining
- densely connected
- polynomial time complexity
- average degree
- strongly connected
- planar graphs
- small world
- np complete