Image de couverture de livre

Counting Cohesive Subgraphs with Hereditary Properties

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Li, Rong-Hua, Ye, Xiaowei, Jin, Fusheng, Wang, Yu-Ping, Yuan, Ye, Wang, Guoren
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Scalable $k$-clique Densest Subgraph Search
par: Ye, Xiaowei, et autres
Publié: (2024)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
par: Ye, Xiaowei, et autres
Publié: (2024)

Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
par: Li, Cheng, et autres
Publié: (2025)

Improved Algorithms for Effective Resistance Computation on Graphs
par: Yang, Yichun, et autres
Publié: (2025)

An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
par: Xu, Xiaojia, et autres
Publié: (2024)

Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets
par: Zhang, Lingling, et autres
Publié: (2024)

Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
par: Yang, Yichun, et autres
Publié: (2024)

From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
par: Döring, Simon, et autres
Publié: (2024)

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
par: Zhou, Yi, et autres
Publié: (2025)

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2024)

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial
par: Curticapean, Radu, et autres
Publié: (2025)

$Δ$-Motif: Parallel Subgraph Isomorphism via Tabular Operations
par: Wang, Yulun, et autres
Publié: (2025)

Packing Compact Subgraphs with Applications to Districting
par: Chen, Ho-Lin, et autres
Publié: (2026)

On the Efficient Discovery of Maximum $k$-Defective Biclique
par: Cui, Donghang, et autres
Publié: (2025)

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
par: Liao, Meihao, et autres
Publié: (2025)

Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity
par: Long, Yaowei, et autres
Publié: (2024)

Counting Small Induced Subgraphs: Hardness via Fourier Analysis
par: Curticapean, Radu, et autres
Publié: (2024)

K-stars LDP: A Novel Framework for (p, q)-clique Enumeration under Local Differential Privacy
par: Sun, Henan, et autres
Publié: (2024)

Scalable Similarity Search over Large Attributed Bipartite Graphs
par: Ou, Xi, et autres
Publié: (2025)

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
par: Meng, Lingkai, et autres
Publié: (2024)

Destroying Densest Subgraphs is Hard
par: Bazgan, Cristina, et autres
Publié: (2024)

Finding Order-Preserving Subgraphs
par: Imamura, Haruya, et autres
Publié: (2025)

Forbidden Subgraph Problems with Predictions
par: Böckenhauer, Hans-Joachim, et autres
Publié: (2025)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
par: Mu, Ta-Yu, et autres
Publié: (2024)

Local Fragments, Global Gains: Subgraph Counting using Graph Neural Networks
par: Roy, Shubhajit, et autres
Publié: (2023)

Multi-dimensional Approximate Counting
par: Wang, Dingyu
Publié: (2024)

On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
par: Firbas, Alexander, et autres
Publié: (2024)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

Subexponential Parameterized Algorithms for Hitting Subgraphs
par: Lokshtanov, Daniel, et autres
Publié: (2024)

Finding Small Complete Subgraphs Efficiently
par: Chen, Ke, et autres
Publié: (2023)

DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
par: Xuan, Wei, et autres
Publié: (2025)

A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
par: Çivril, Ali
Publié: (2023)

Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs
par: Bieliński, Paweł Rafał, et autres
Publié: (2026)

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph
par: Yu, Xifan, et autres
Publié: (2024)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
par: Yu, Kaiqiang, et autres
Publié: (2025)

Approximately Counting Knapsack Solutions in Subquadratic Time
par: Feng, Weiming, et autres
Publié: (2024)

The Complexity Landscape of Dynamic Distributed Subgraph Finding
par: Chang, Yi-Jun, et autres
Publié: (2024)

New Parallel and Streaming Algorithms for Directed Densest Subgraph
par: Mitrović, Slobodan, et autres
Publié: (2025)

Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries
par: Kothalawala, Buddhi, et autres
Publié: (2026)

Dense Subgraph Discovery Meets Strong Triadic Closure
par: Arachchi, Chamalee Wickrama, et autres
Publié: (2025)