Login / Signup
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles.
Suman K. Bera
Noujan Pashanasangi
C. Seshadhri
Published in:
CoRR (2020)
Keyphrases
</>
bipartite graph
bounded treewidth
worst case
np complete
graph structure
knowledge base
data sets
upper bound
graph theory
series parallel
graph partitioning
heavy tails
structured objects
subgraph isomorphism
graph construction
graph clustering
graph representation
graph model
graph mining
object recognition