A divide-and-conquer-based algorithm is proposed, which not only reduces the search space but also has an improved time complexity and is up to two orders of magnitude faster than the state-of-the-art.
Density decomposition characterizes the multi-level dense structure of large networks and supports a wide range of graph mining applications. Given a graph
G = (V, E)
, it assigns each vertex an integral dense number (IDN) and produces a nested sequence of layers D
0
⊇ D
1
⊇ ... ⊇ D
p
that capture increasingl...
Ya-Long Zhang, Rong-Hua Li, Qi Zhang et al.· Proceedings of the ACM on Ma...· 0 citations
Structural graph queries involving connectivity constraints are fundamental primitives in modern data management and analytics. Compared with degree- and edge-based variants, connectivity-based γ-quasi-cliques (γ-CQCs) impose stronger structural constraints and fault tolerance, where robustness is measured by vertex...
Yang Liu, He-Jiao Huang, Kai-Qiang Yu et al.· Proceedings of the ACM on Ma...· 0 citations
BoxDPpS performs box-level search with safe region pruning, eliminates redundant representations of the same iRM-set, improves early pruning through bounded warm-up, and compresses each fixed-M auxiliary network for exact parametric pseudoflow solving.
Jia-Dong Xie, Jiaming Yang, Kangfei Zhao et al.· 0 citations
Centroids are used to compute an arbitrary number of simple paths with some important benefits: the expansion of a single centroid delivers an arbitrary number of paths; only a single Dijk-stra search is required to complete the task; the same algorithm can be easily coupled with heuristics that improve search efficien...
Carlos Linares López, I. Herman· Proceedings of the Thirty-Fi...· 0 citations
This paper provides the first truly linear-time approximation scheme for the Densest Subgraph Problem, and uses assignments arising from a flow-based formulation together with a structural carving lemma to progressively carve "sparse" parts of the graph while nearly preserving the densest subgraph.
We develop a new algorithm for counting the number of subgraphs of a network isomorphic to a given query graph (#SubgraphIsomorphism), motivated by network motif search. High-degree vertices (hubs), common in real-world networks, contribute to a combinatorial explosion in the number of subgraphs, making existing motif...
Tarek Tohme, Joshua A. Grochow· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
