Modularity-maximizing graph communities via mathematical programming

Author： Agarwal G.  

Publisher： Springer Publishing Company

ISSN： 1434-6028

Source： The European Physical Journal B - Condensed Matter, Vol.66, Iss.3, 2008-12, pp. : 409-418

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On semidefinite programming bounds for graph bandwidth

By de Klerk Etienne   E.-Nagy Marianna   Sotirov Renata  

Optimization Methods and Software, Vol. 28, Iss. 3, 2013-06 ,pp. : 485-500

Taylor & Francis Ltd

Access to resources Recommend Favorite

Mathematical Minute: Rotating a Function Graph

By Bravo Daniel   Fera Joseph  

The College Mathematics Journal, Vol. 44, Iss. 2, 2013-03 ,pp. : 124-125

Mathematical Association of America

Access to resources Recommend Favorite

Mathematical programming in rough environment

By Osman M. S.  

Optimization, Vol. 60, Iss. 5, 2011-01 ,pp. : 603-611

Taylor & Francis Ltd

Access to resources Recommend Favorite

Error Bounds in Mathematical Programming

By  

Mathematical Programming, Vol. 88, Iss. 2, 2000-08 ,pp. : 221-222

Elsevier

Access to resources Recommend Favorite

A DYNAMIC PROGRAMMING ALGORITHM TO TEST A SIGNED GRAPH FOR BALANCE

By LOUKAKIS E.  

International Journal of Computer Mathematics, Vol. 80, Iss. 4, 2003-04 ,pp. : 499-507

Taylor & Francis Ltd

Access to resources Recommend Favorite