Finding, minimizing, and counting weighted subgraphs

@inproceedings{Williams2009FindingMA,
  title={Finding, minimizing, and counting weighted subgraphs},
  author={V. V. Williams and Ryan Williams},
  booktitle={STOC '09},
  year={2009}
}
For a pattern graph H on k nodes, we consider the problems of finding and counting the number of (not necessarily induced) copies of H in a given large graph G on n nodes, as well as finding minimum weight copies in both node-weighted and edge-weighted graphs. Our results include: The number of copies of an H with an independent set of size s can be computed exactly in O*(2s nk-s+3) time. A minimum weight copy of such an H (with arbitrary real weights on nodes and edges) can be found in O(4s+o… Expand
Homomorphisms are a good basis for counting small subgraphs
TLDR
Graph motif parameters are introduced, a class of graph parameters that depend only on the frequencies of constant-size induced subgraphs, and a general complexity dichotomy for evaluating graph motif parameters is proved, which allows us to recover known dichotomies for counting sub graphs, induced sub Graph, and homomorphisms in a uniform and simplified way. Expand
Exact Weight Subgraphs and the k-Sum Conjecture
TLDR
It is shown that under the k-sum Conjecture, one can achieve tight upper and lower bounds for the Exact-Weight-H problem for various subgraphs H such as matching, star, path, and cycle and that improving on the O(n3) upper bound will imply improved algorithms for 3-sum, 5- sum, All-Pairs Shortest Paths and other fundamental problems. Expand
Are unique subgraphs not easier to find?
TLDR
This paper provides an analogous correction in the induced case when occurrences of induced subgraphs isomorphic to H are sought and provides an O ˜ ( ( l ( d − 1 ) + 2 ) l ) bound on the multiplicative factor instead, where d is the maximum number of occurrences of H that can share the same edge in the input host graph. Expand
The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
TLDR
A data structure that maintains the number of triangles in a dynamic undirected graph, subject to insertions and deletions of edges and of degree-zero vertices, which has applications in social network analysis using the exponential random graph model (ERGM). Expand
Counting Subgraphs in Degenerate Graphs
TLDR
It is shown that this sufficient condition for a graph to be easy if there is a linear-time algorithm for counting the number of copies in an input graph of bounded degeneracy is also necessary, thus fully answering the Bera--Pashanasangi--Seshadhri problem. Expand
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
TLDR
A data structure that maintains the number of triangles in a dynamic undirected graph, subject to insertions and deletions of edges and of degree-zero vertices, which has applications in social network analysis using the exponential random graph model (ERGM). Expand
Unique subgraphs are not easier to find
TLDR
It follows that for pattern graphs of constant size, the aforementioned uniqueness guarantee cannot yield any asymptotic speed up. Expand
Graph pattern detection: hardness for all induced patterns and faster non-induced cycles
TLDR
It is shown that for every k, there exists a k-node pattern that contains a k−1-clique and that can be detected as an induced subgraph in n node graphs in the best known running time for k− 1-Clique detection. Expand
Subgraph Enumeration in Massive Graphs
TLDR
A lower bound shows that the deterministic algorithm is optimal for some pattern graphs with $s=k/2$ (e.g., paths and cycles of even length, meshes of even side), while the randomized algorithm is ideal for a wide class of pattern graphs, called Alon class. Expand
Weighted Counting of k-Matchings Is #W[1]-Hard
TLDR
The authors prove hardness for a natural weighted generalization of the problem of counting k-partial cycle covers, which are vertex-disjoint unions of cycles including k edges in total, and prove that this hardness result even holds for unweighted graphs. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 70 REFERENCES
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems
TLDR
An O(nt(ω,h) time algorithm for MIN H-SUBGRAPH in case H is a fixed graph with h vertices and ω< 2.376 is the exponent of matrix multiplication, and an O(n3/logn) time randomized algorithm for finding the smallest cycle of any fixed length. Expand
Subcubic Equivalences between Path, Matrix and Triangle Problems
TLDR
Generic equivalences between matrix products over a large class of algebraic structures used in optimization, verifying a matrix product over the same structure, and corresponding triangle detection problems over the structure are shown. Expand
Approximation Algorithms for Some Parameterized Counting Problems
TLDR
A randomized fixed parameter tractable algorithm to approximately count the number of copies of a k-vertex graph with bounded treewidth in an n vertex graph is given, based on the Karp-Luby approximate counting technique and the color-coding technique of Alon, Yuster and Zwick. Expand
Arboricity and Subgraph Listing Algorithms
TLDR
A new simple strategy into edge-searching of a graph, which is useful to the various subgraph listing problems, is introduced, and an upper bound on $a(G)$ is established for a graph $G:a (G) \leqq \lceil (2m + n)^{1/2} \rceil $, where n is the number of vertices in G. Expand
Finding a maximum weight triangle in n3-Δ time, with applications
TLDR
This work presents the first truly sub-cubic algorithms for finding a maximum node-weighted triangle in directed and undirected graphs with arbitrary real weights, and shows how to efficiently sample a weighted triangle uniformly at random. Expand
Finding and Counting Small Induced Subgraphs Efficiently
TLDR
Two algorithms for listing all simplicial vertices of a graph are given and can be implemented to run in O(e) time, where e is the number of edges in the graph. Expand
Color-coding
TLDR
A novel randomized method, the method of color-coding for finding simple paths and cycles of a specified length k, and other small subgraphs, within a given graph G = (V,E), which can be derandomized using families of perfect hash functions. Expand
Efficient semi-streaming algorithms for local triangle counting in massive graphs
TLDR
This is the first paper that addresses the problem of local triangle counting with a focus on the efficiency issues arising in massive graphs and proposes two approximation algorithms, which are based on the idea of min-wise independent permutations. Expand
Counting Paths and Packings in Halves
TLDR
It is shown that one can count k-edge paths in an n-vertex graph and m-set k-packings on ann-element universe, respectively, in time up to a factor polynomial in n, k, and m; inPolynomial space, the bounds hold if multiplied by 3 k/2 or 5 mk/2, respectively. Expand
Recognizing small subgraphs
TLDR
An O(n f m) algorithm for recognizing a fixed subgraph H with flower number f within a graph G with n vertices and m edges is presented, which matches the best algorithms known for recognizing small paths, cycles, and cliques. Expand
...
1
2
3
4
5
...