From post

Optimal Parallel Circle-Cover and Independent Set Algorithms for Circular-Arc Graphs.

, , и . ICPP (3), стр. 126-129. Pennsylvania State University Press, (1989)0-271-00686-2.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

The Full Steiner Tree Problem in Phylogeny., , и . COCOON, том 2387 из Lecture Notes in Computer Science, стр. 107-116. Springer, (2002)The approximability of the weighted Hamiltonian path completion problem on a tree., , и . Theor. Comput. Sci., 341 (1-3): 385-397 (2005)Bit-Parallel Algorithms for Exact Circular String Matching., , и . Comput. J., 57 (5): 731-743 (2014)A near pattern-matching scheme based upon principal component analysis., , и . Pattern Recognit. Lett., 16 (4): 339-345 (1995)Optimal Parallel Circle-Cover and Independent Set Algorithms for Circular-Arc Graphs., , и . ICPP (3), стр. 126-129. Pennsylvania State University Press, (1989)0-271-00686-2.A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile., , и . Comput. Oper. Res., 16 (3): 257-269 (1989)The full Steiner tree problem., , и . Theor. Comput. Sci., 306 (1-3): 55-67 (2003)The exact multiple pattern matching problem solved by a reference tree approach., , , и . Theor. Comput. Sci., (2021)