On the Complexity of Strongly Connected Components in Directed Hypergraphs

ISSN： 0178-4617

Source： Algorithmica, Vol.69, Iss.2, 2014-06, pp. : 335-369

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

Which Problems Have Strongly Exponential Complexity?

By Impagliazzo R. Paturi R. Zane F.

Journal of Computer and System Sciences, Vol. 63, Iss. 4, 2001-12 ,pp. : 512-530

Academic Press

Access to resources Recommend Favorite

Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study

By Bader D.A. JaJa J.

Journal of Parallel and Distributed Computing, Vol. 35, Iss. 2, 1996-06 ,pp. : 173-190

Academic Press

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

Modelling systems by hypergraphs

By GazdÃk Igor

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 35, Iss. 9, 2006-10 ,pp. : 1369-1381

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

How can multimodal cues from child-directed interaction reduce learning complexity in robots?

By Rohlfing Katharina J. Fritsch Jannik Wrede Britta Jungmann Tanja

Advanced Robotics, Vol. 20, Iss. 10, 2006-10 ,pp. : 1183-1199

Taylor & Francis Ltd

Access to resources Recommend Favorite