Finding All Maximal Cliques in Dynamic Graphs

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.27, Iss.2, 2004-02, pp. : 173-186

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

An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs

By Bera D. Pal M. Pal T.

International Journal of Computer Mathematics, Vol. 79, Iss. 10, 2002-01 ,pp. : 1057-1065

Taylor & Francis Ltd

Access to resources Recommend Favorite

Contractible Cliques in k-Connected Graphs

By Huang Xiaolong Jin Zemin Yu Xingxing Zhang Xiaoyan

Graphs and Combinatorics, Vol. 22, Iss. 3, 2006-11 ,pp. : 361-370

Springer Publishing Company

Access to resources Recommend Favorite

Maximal matching and edge domination in complete multipartite graphs

By Song Wenyao Miao Lianying Wang Haichao Zhao Yancai

International Journal of Computer Mathematics, Vol. 91, Iss. 5, 2014-05 ,pp. : 857-862

Taylor & Francis Ltd

Access to resources Recommend Favorite

Finding a Zero of The Sum of Two Maximal Monotone Operators

By Moudafi A. Théra M.

Journal of Optimization Theory and Applications, Vol. 94, Iss. 2, 1997-08 ,pp. : 425-448

Springer Publishing Company

Access to resources Recommend Favorite

Finding Minors in Graphs with a Given Path Structure

JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 1, 2015-05 ,pp. : 30-47

John Wiley & Sons Inc

Access to resources Recommend Favorite