A linear-time recognition algorithm for P 4 -reducible graphs

By M. Nivat   Jamison B.   Olariu S.  

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 329-344

Elsevier

Access to resources Recommend Favorite

On clique-colouring of graphs with few P ₄’s

By Klein Sulamita   Morgana Aurora  

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

Springer Publishing Company

Access to resources Recommend Favorite

Identifying functions in binary code with reverse extended control flow graphs

By  

JOURNAL OF SOFTWARE: EVOLUTION AND PROCESS (ELECTRONIC), Vol. 2047-7473, Iss. 10, 2015-10 ,pp. : 793-820

John Wiley & Sons Inc

Access to resources Recommend Favorite

Parallelisable variants of Camellia and SMS4 block cipher: p-Camellia and p-SMS4

By Yap Huihui  

International Journal of Applied Cryptography, Vol. 3, Iss. 1, 2013-04 ,pp. : 1-20

Inderscience Publishers

Access to resources Recommend Favorite

Algorithms for P₄-Comparability Graph Recognition and Acyclic P₄-Transitive Orientation

By Nikolopoulos Stavros D.   Palios Leonidas  

Algorithmica, Vol. 39, Iss. 2, 2004-02 ,pp. : 95-126

Springer Publishing Company

Access to resources Recommend Favorite