Related content

Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities

By Vilím Petr   Barták Roman   Čepek Ondřej  

Constraints, Vol. 10, Iss. 4, 2005-10 ,pp. : 403-425

Springer Publishing Company

Access to resources Recommend Favorite

New Results on the Queens_n² Graph Coloring Problem

By Vasquez Michel  

Journal of Heuristics, Vol. 10, Iss. 4, 2004-07 ,pp. : 407-413

Springer Publishing Company

Access to resources Recommend Favorite

An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs

By Elmasry Amr   Mehlhorn Kurt   Schmidt Jens  

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 754-766

Springer Publishing Company

Access to resources Recommend Favorite

Fully dynamic distributed search trees can be balanced in O(lg² N) time

By Barillari F.   Nardelli E.   Pepe M.  

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 11, 2002-11 ,pp. : 1617-1628

Academic Press

Access to resources Recommend Favorite

Minimized embedding of arbitrary hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II. Grids and k-fault-tolerance

By Karavai M.  

Automation and Remote Control, Vol. 66, Iss. 2, 2005-02 ,pp. : 328-340

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite