Parallel algorithms for Hamiltonian problems on quasi-threshold graphs

By Nikolopoulos S.D.  

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

Elsevier

Access to resources Recommend Favorite

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

By Chen J.   Kanj I.A.  

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 833-847

Elsevier

Access to resources Recommend Favorite

On the existence of subexponential parameterized algorithms

By Cai L.   Juedes D.  

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 789-807

Elsevier

Access to resources Recommend Favorite

Parameterized Pattern Matching: Algorithms and Applications

By Baker B.S.  

Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. : 28-42

Academic Press

Access to resources Recommend Favorite

A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance

By Chen Y-Chuang   Huang Yong-Zen   Hsu Lih-Hsing   Tan Jimmy  

The Journal of Supercomputing, Vol. 54, Iss. 2, 2010-11 ,pp. : 229-238

Springer Publishing Company

Access to resources Recommend Favorite