Semidefinite programming for graph partitioning with preferencesin data distribution

DOI10.1007/3-540-36569-9_48MaRDI QIDQ4414828zbMATH OpenFDO

Authors Suely Oliveira, Takako Soma, David E. Stewart

Publication date 27 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2565/25650703.htm

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A subspace semidefinite programming for spectral graph partitioning
• Graph partitioning using linear and semidefinite programming
• Semidefinite programming relaxations for the graph partitioning problem
• scientific article; zbMATH DE number 1182569
• scientific article; zbMATH DE number 1560335

Cited in

(1)

• A subspace semidefinite programming for spectral graph partitioning

This page was built for publication: Semidefinite programming for graph partitioning with preferencesin data distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414828)