A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Nearly Optimal Time Bounds for kPath in Hypergraphs
[article]
2019
arXiv
pre-print
We give almost tight conditional lower bounds on the running time of the kHyperPath problem. Given an r-uniform hypergraph for some integer r, kHyperPath seeks a tight path of length k. That is, a sequence of k nodes such that every consecutive r of them constitute a hyperedge in the graph. This problem is a natural generalization of the extensively-studied kPath problem in graphs. We show that solving kHyperPath in time O^*(2^(1-γ)k) where γ>0 is independent of r is probably impossible.
arXiv:1803.04940v2
fatcat:cxx6ro7hvzbeba3wmr4i2p6bgq