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

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

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

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

k-Optimal: a novel approximate inference algorithm for ProbLog

By Renkens Joris   Broeck Guy   Nijssen Siegfried  

Machine Learning, Vol. 89, Iss. 3, 2012-12 ,pp. : 215-231

Springer Publishing Company

Access to resources Recommend Favorite