Finding All Maximal Cliques in Dynamic Graphs

By Stix Volker  

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

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs

By Hota Mrinmoy   Pal Madhumangal   Pal Tapan K.  

Computational Optimization and Applications, Vol. 27, Iss. 1, 2004-01 ,pp. : 95-113

Springer Publishing Company

Access to resources Recommend Favorite

A linear time algorithm to construct a tree 4-spanner on trapezoid graphs

By Barman Sambhu Charan  

International Journal of Computer Mathematics, Vol. 87, Iss. 4, 2010-03 ,pp. : 743-755

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

By Arimura Hiroki   Uno Takeaki  

Journal of Combinatorial Optimization, Vol. 13, Iss. 3, 2007-04 ,pp. : 243-262

Springer Publishing Company

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