Kernelization of Graph Hamiltonicity: Proper H-Graphs.
Steven ChaplickFedor V. FominPetr A. GolovachDusan KnopPeter ZemanPublished in: WADS (2019)
Keyphrases
- graph representation
- graph theory
- graph theoretic
- weighted graph
- graph matching
- labeled graphs
- graph structure
- graph databases
- directed graph
- graph construction
- graph mining
- graph classification
- adjacency matrix
- series parallel
- graph model
- graph search
- subgraph isomorphism
- graph properties
- graph theoretical
- undirected graph
- graph clustering
- graph structures
- reachability queries
- dynamic graph
- graph partitioning
- graph data
- random graphs
- evolving graphs
- bipartite graph
- graph edit distance
- graph transformation
- graph isomorphism
- graph representations
- polynomial time complexity
- structural pattern recognition
- edge weights
- real world graphs
- maximum independent set
- spanning tree
- random walk
- graph drawing
- directed acyclic
- attributed graphs
- finding the shortest path
- inexact graph matching
- disk resident
- average degree
- connected graphs
- np complete
- web graph
- minimum spanning tree
- graph kernels
- planar graphs
- maximal cliques
- graph embedding
- independent set
- massive graphs
- dense subgraphs
- neighborhood graph
- community discovery
- query graph
- maximum clique
- frequent subgraphs
- graph layout
- topological information
- small world
- connected components
- connected dominating set
- bounded degree
- association graph
- directed acyclic graph
- structured data
- social networks
- maximum common subgraph