Jul 17, 2023 · Our main idea is a novel graph reduction that transforms a balanced clique problem over a signed graph G to problems over small subgraphs of G .
scholar.google.com › citations
In this paper, we consider balanced cliques — a clique is balanced if its vertex set C can be partitioned into CL and CR such that all negative edges are ...
Our main idea is a novel graph reduction that transforms a balanced clique problem over a signed graph - to problems over small subgraphs of -.
Oct 22, 2024 · In this paper, we consider balanced cliques — a clique is balanced if its vertex set C C can be partitioned into C L C_{L} and C R C_{R} such ...
Signed graphs have been used to capture the polarity of relationships through positive/negative edge signs. In this paper, we consider balanced cliques ...
Motivated by this, we in this paper investigate the maximum balanced clique problem, aiming to find the largest balanced clique C∗ ⊆ V that satisfies |C∗L| ≥ τ ...
Feb 3, 2020 · Signed networks are graphs whose edges are labelled with either a positive or a negative sign, and can be used to capture nuances in.
Apr 20, 2020 · In this paper we propose an efficient algorithm for finding large balanced subgraphs in signed networks.
Missing: Identifying | Show results with:Identifying
Dec 18, 2024 · Structural graph clustering ( SCAN ) is a foundational graph analysis task about managing and profiling graph datasets.
Apr 1, 2022 · The experimental results demonstrate the efficiency, effectiveness and scalability of our proposed algorithms for MBCE problem and MBCS problem.