Imagen de Portada

Density Decomposition on Hypergraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Leng, Xiaoyu, Qin, Hongchao, Li, Rong-Hua
Formato:	Preprint
Publicado:	2026
Materias:	Social and Information Networks Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
por: Han, Seongjune, et al.
Publicado: (2026)

Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets
por: Zhang, Lingling, et al.
Publicado: (2024)

An Edge-Based Decomposition Framework for Temporal Networks
por: Oettershagen, Lutz, et al.
Publicado: (2023)

Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
por: Srivastava, Ajitesh, et al.
Publicado: (2024)

Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to Hypergraphs
por: Li, Zihao, et al.
Publicado: (2024)

Near-Optimal Differentially Private k-Core Decomposition
por: Dhulipala, Laxman, et al.
Publicado: (2023)

Spectral Triadic Decompositions of Real-World Networks
por: Basu, Sabyasachi, et al.
Publicado: (2022)

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
por: Zhou, Alexander, et al.
Publicado: (2026)

inGRASS: Incremental Graph Spectral Sparsification via Low-Resistance-Diameter Decomposition
por: Aghdaei, Ali, et al.
Publicado: (2024)

Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality
por: Li, Zihao, et al.
Publicado: (2024)

Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs
por: Nakamura, Kengo, et al.
Publicado: (2026)

Profit Maximization in Closed Social Networks
por: Sharma, Poonam, et al.
Publicado: (2026)

Graph Discovery and Source Detection in Temporal Graphs
por: Bals, Ben
Publicado: (2025)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
por: Zheng, Dehong, et al.
Publicado: (2025)

Multilevel Digital Contact Tracing
por: Mahapatra, Gautam, et al.
Publicado: (2020)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
por: Chen, Jingbang, et al.
Publicado: (2024)

Finding coherent node groups in directed graphs
por: Kumpulainen, Iiro, et al.
Publicado: (2023)

Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
por: Chang, Lijun
Publicado: (2024)

Inferring Tie Strength in Temporal Networks
por: Oettershagen, Lutz, et al.
Publicado: (2022)

Fast Approximate CoSimRanks via Random Projections
por: Yang, Renchi, et al.
Publicado: (2020)

Temporal Betweenness Centrality on Shortest Walks Variants
por: Naima, Mehdi
Publicado: (2023)

A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs
por: Brandt-Tumescheit, Fabian, et al.
Publicado: (2024)

Fast Percolation Centrality Approximation with Importance Sampling
por: Cruciani, Antonio, et al.
Publicado: (2025)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
por: Lu, Qiheng, et al.
Publicado: (2025)

Catch Me If You Can: Finding the Source of Infections in Temporal Networks
por: Bals, Ben, et al.
Publicado: (2024)

On the External Validity of Average-Case Analyses of Graph Algorithms
por: Bläsius, Thomas, et al.
Publicado: (2022)

Fast Estimation of Percolation Centrality
por: Cruciani, Antonio
Publicado: (2024)

Equalizing Closeness Centralities via Edge Additions
por: Crane, Alex, et al.
Publicado: (2025)

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
por: Spaeh, Fabian, et al.
Publicado: (2025)

Efficient Sampling of Temporal Networks with Preserved Causality Structure
por: Stamm, Felix I., et al.
Publicado: (2025)

Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models
por: Bishnu, Arijit, et al.
Publicado: (2025)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
por: Bläsius, Thomas, et al.
Publicado: (2024)

On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
por: Lu, Qiheng, et al.
Publicado: (2024)

A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
por: You, Fangchen
Publicado: (2025)

Opinion Maximization in Social Networks by Modifying Internal Opinions
por: Wang, Gengyu, et al.
Publicado: (2025)

Locally Differentially Private Graph Clustering via the Power Iteration Method
por: Suppakitpaisarn, Vorapong, et al.
Publicado: (2025)

On the accurate computation of expected modularity in probabilistic networks
por: Shen, Xin, et al.
Publicado: (2024)

Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method
por: Cui, Guanyu, et al.
Publicado: (2025)

Optimizing Probabilistic Propagation in Graphs by Adding Edges
por: Bhaskara, Aditya, et al.
Publicado: (2024)

MANTRA: Temporal Betweenness Centrality Approximation through Sampling
por: Cruciani, Antonio
Publicado: (2023)