A DYNAMIC PROGRAMMING ALGORITHM TO TEST A SIGNED GRAPH FOR BALANCE

ISSN： 0020-7160

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

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

Balance in Random Signed Graphs

By EL Maftouhi A.

Internet Mathematics, Vol. 8, Iss. 4, 2012-12 ,pp. : 364-380

Taylor & Francis Ltd

Access to resources Recommend Favorite

A dynamic programming strategy to balance exploration and exploitation in the bandit problem

By Caelen Olivier Bontempi Gianluca

Annals of Mathematics and Artificial Intelligence, Vol. 60, Iss. 1-2, 2010-10 ,pp. : 3-24

Springer Publishing Company

Access to resources Recommend Favorite

Separator-based data reduction for signed graph balancing

By Hüffner Falk Betzler Nadja Niedermeier Rolf

Journal of Combinatorial Optimization, Vol. 20, Iss. 4, 2010-11 ,pp. : 335-360

Springer Publishing Company

Access to resources Recommend Favorite

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

Principal graph stability and the jellyfish algorithm

By Bigelow Stephen Penneys David

Mathematische Annalen, Vol. 358, Iss. 1-2, 2014-02 ,pp. : 1-24

Springer Publishing Company

Access to resources Recommend Favorite