Visualizing network communities with a semi-definite programming method

DOI10.1016/j.ins.2015.05.037zbMath1390.68505OpenAlexW430264494MaRDI QIDQ1750020

Wenye Li

Publication date: 17 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.05.037

zbMATH Keywords

semi-definite programminggraph layoutnetwork modularity

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Semidefinite programming (90C22) Graph theory (including graph drawing) in computer science (68R10)

Related Items

A non-probabilistic methodology for reliable sustainability planning: an application to the Iraqi national irrigation system

Uses Software

• CSDP
• SDPLR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anti-modularity and anti-community detecting in complex networks
• Semidefinite programming in combinatorial optimization
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• Group detection in complex networks: an algorithm and comparison of the state of the art
• An algorithm for drawing general undirected graphs
• Maximizing modularity intensity for community partition and evolution
• Revealing network communities with a nonlinear programming method
• Enhancing community detection using a network weighting strategy
• Numerical Optimization
• CSDP, A C library for semidefinite programming
• Community structure in social and biological networks
• The Average Distance in a Random Graph with Given Expected Degrees
• Semidefinite Programming
• An Interior-Point Method for Semidefinite Programming
• Efficient discovery of overlapping communities in massive networks
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Networks

This page was built for publication: Visualizing network communities with a semi-definite programming method