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

Author： Elmasry Amr   Mehlhorn Kurt   Schmidt Jens  

Publisher： Springer Publishing Company

ISSN： 0178-4617

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

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

Related content

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

A Two-Phase BMAP|G|1|N → PH|1|M – 1 System with Blocking

By Breuer D.   Dudin A. N.   Klimenok V. I.   Tsarenkov G. V.  

Automation and Remote Control, Vol. 65, Iss. 1, 2004-01 ,pp. : 104-115

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

An O(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness

By Tian Zhongjun   Ng C.   Cheng T.  

Journal of Scheduling, Vol. 9, Iss. 4, 2006-08 ,pp. : 343-364

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

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