π
π
The Cartographer
Computing the number of induced copies of a fixed graph in a bounded degree graph
July 14, 2017 Β· Declared Dead Β· π Algorithmica
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Viresh Patel, Guus Regts
arXiv ID
1707.05186
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DM,
math.CO
Citations
17
Venue
Algorithmica
Last Checked
3 months ago
Abstract
In this paper we show that for any graph $H$ of order $m$ and any graph $G$ of order $n$ and maximum degree $Ξ$ one can compute the number of subsets $S$ of $V(G)$ that induces a graph isomorphic to $H $in time $O(c^m\cdot n)$ for some constant $c = c(Ξ) > 0$. This is essentially best possible.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted