Cover Image

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Jingbang, Mang, Qiuyang, Zhou, Hangrui, Peng, Richard, Gao, Yu, Ma, Chenhao
Format:	Preprint
Published:	2024
Subjects:	Social and Information Networks Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finding the Balance Rate of Uncertain Signed Graphs
by: Wang, Zeyu, et al.
Published: (2026)

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

Nearly Optimal Internal Dictionary Matching
by: Chen, Jingbang, et al.
Published: (2023)

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

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

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

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
by: Basu, Sabyasachi, et al.
Published: (2024)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
by: Lin, Wenqing, et al.
Published: (2025)

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

Scalable Temporal Motif Densest Subnetwork Discovery
by: Sarpe, Ilie, et al.
Published: (2024)

Enabling Asymptotic Truth Learning in a Social Network
by: Lu, Kevin, et al.
Published: (2024)

Finding Small Complete Subgraphs Efficiently
by: Chen, Ke, et al.
Published: (2023)

The Complexity Landscape of Dynamic Distributed Subgraph Finding
by: Chang, Yi-Jun, et al.
Published: (2024)

Finding the root in random nearest neighbor trees
by: Brandenberger, Anna, et al.
Published: (2024)

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

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

Finding Order-Preserving Subgraphs
by: Imamura, Haruya, et al.
Published: (2025)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
by: Davot, Tom, et al.
Published: (2024)

Entrywise Approximate Laplacian Solving
by: Chen, Jingbang, et al.
Published: (2024)

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

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

BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
by: Najafi, Mohammad Matin, et al.
Published: (2025)

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

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
by: Norose, Ryoma, et al.
Published: (2024)

Graph Reconstruction from Noisy Random Subgraphs
by: McGregor, Andrew, et al.
Published: (2024)

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

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

On the Complexity of Community-aware Network Sparsification
by: Herrendorf, Emanuel, et al.
Published: (2024)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
by: Zhou, Yingli, et al.
Published: (2024)

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

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

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

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

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
by: Basu, Sabyasachi, et al.
Published: (2024)

Scalable Approximate Biclique Counting over Large Bipartite Graphs
by: Chen, Jingbang, et al.
Published: (2025)

Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model
by: Feng, Weiming, et al.
Published: (2025)

Sandpile Prediction on Undirected Graphs
by: Chang, Ruinian, et al.
Published: (2023)

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

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
by: Mang, Qiuyang, et al.
Published: (2024)

An Efficient Streaming Algorithm for Approximating Graphlet Distributions
by: Bressan, Marco, et al.
Published: (2026)