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

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

Publisher： Springer Publishing Company

ISSN： 1383-7133

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

O(log*n) algorithms on a Sum-CRCW PRAM

By Eisenstat S.  

Computing, Vol. 79, Iss. 1, 2007-02 ,pp. : 93-97

Springer Publishing Company

Access to resources Recommend Favorite

Treemap: An O(log n) algorithm for indoor simultaneous localization and mapping

By Frese Udo  

Autonomous Robots, Vol. 21, Iss. 2, 2006-09 ,pp. : 103-122

Springer Publishing Company

Access to resources Recommend Favorite

An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

By Bloem Roderick   Gabow Harold   Somenzi Fabio  

Formal Methods in System Design, Vol. 28, Iss. 1, 2006-01 ,pp. : 37-56

Springer Publishing Company

Access to resources Recommend Favorite

Finding a Minimum-depth Embedding of a Planar Graph in O(n 4) Time

By Angelini Patrizio   Battista Giuseppe   Patrignani Maurizio  

Algorithmica, Vol. 60, Iss. 4, 2011-08 ,pp. : 890-937

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