Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
A local algorithm for structure-preserving graph cut
Dawei Zhou
, Si Zhang
, Mehmet Yigit Yildirim
, Scott Alcorn
,
Hanghang Tong
, Hasan Davulcu
,
Jingrui He
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A local algorithm for structure-preserving graph cut'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Graph Cuts
100%
Structure Preservation
100%
Local Algorithms
100%
High-order Network Structure
100%
Conductance
75%
High-order
75%
Higher-order Structure
50%
Eficiency
50%
Local Cut
50%
Computational Cost
25%
Real-world Application
25%
Random Walk
25%
Social Networks
25%
Loop Structure
25%
Number of Edges
25%
Polylogarithmic Time
25%
Protein-protein Interaction Network
25%
Information Networks
25%
Generic Definition
25%
Entire Graphs
25%
Graph Mining
25%
Impact Domains
25%
Co-authorship Network
25%
First-order Markov Chain
25%
Star Structure
25%
Graph Clustering Algorithms
25%
Local Graph Clustering
25%
Synthetic Graphs
25%
Large-scale Graph Data
25%
Financial Networks
25%
Bank Customers
25%
High Order Diffusion
25%
Computer Science
Graph Cut
100%
Subgraphs
100%
Local Algorithm
100%
Network Structure
100%
Order Structure
50%
Computational Cost
25%
Experimental Result
25%
World Application
25%
Clustering Algorithm
25%
Information Network
25%
coauthorship
25%
Social Network
25%
Random Walk
25%
Markov Chain
25%