New Bounds on Even Cycle Creating Hamiltonian Paths Using Expander Graphs.
Gergely HarcosDaniel SoltészPublished in: Comb. (2020)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- graph theoretic
- worst case
- graph matching
- graph representation
- tight bounds
- error bounds
- data sets
- series parallel
- graph model
- graph mining
- graph structure
- weighted graph
- graph theory
- graph databases
- graph partitioning
- approximation algorithms
- shortest path
- data structure
- graph data
- path finding
- graph clustering
- graph kernels
- subgraph isomorphism
- website
- database
- structured objects