AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Forbidden Nodes Aware Community Search

Chaokun Wang, Junchao Zhu

AAAI 2019 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features · 13 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use weighted-conductance (PPR-weighted) FORTE-CW instead of k-truss searchFORTE · Amazontime cost (min): 7.67 min -> 1.41 minImproved
use FORTE-CW instead of FORTE-k-core or k-trussFORTE · DBLP/Amazon/YouTubef-measureImproved
use FORTE-CW instead of FORTE-k-coreFORTE · DBLPtime cost (min): 1.46 min -> 1.51 minHurt
use k-truss or CW instead of k-core for local modularityFORTE · DBLP/Amazon/YouTubelocal modularityImproved
use FORTE-CW instead of FORTE-k-trussFORTE · DBLP combination ivCloseness-to-the-Forbidden: 22.8 -> 2.72Improved
use FORTE-CW instead of FORTE-k-trussFORTE · DBLP combination iiiCloseness-to-the-Forbidden: 0.01 -> 0.92Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy