Steiner systems S(v, k, k − 1): Components and rank

By Zinoviev V.   Zinoviev D.  

Problems of Information Transmission, Vol. 47, Iss. 2, 2011-06 ,pp. : 130-148

MAIK Nauka/Interperiodica

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

Solving Connected Dominating Set Faster than 2 ⁿ

By Fomin Fedor   Grandoni Fabrizio   Kratsch Dieter  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 153-166

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

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