Graph theory and algorithms: Fourth Latin-American Workshop on Cliques in Graphs

By Figueiredo Celina  

Journal of the Brazilian Computer Society, Vol. 18, Iss. 2, 2012-06 ,pp. : 83-84

Springer Publishing Company

Access to resources Recommend Favorite

A greedy random adaptive search procedure for the weighted maximal planar graph problem

By Osman I.H.   Al-Ayoubi B.   Barake M.  

Computers and Industrial Engineering, Vol. 45, Iss. 4, 2003-12 ,pp. : 635-651

Elsevier

Access to resources Recommend Favorite

Efficient enumeration of all minimal separators in a graph

By Hong S.   Weifa L.  

Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. : 169-180

Elsevier

Access to resources Recommend Favorite

Enumerating all connected maximal common subgraphs in two graphs

By Koch I.  

Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. : 1-30

Elsevier

Access to resources Recommend Favorite

The hierarchical cliques interconnection network

By Campbell S.   Kumar M.   Olariu S.  

Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. : 16-28

Elsevier

Access to resources Recommend Favorite