Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata

Author： Beame P.   Borodin A.   Raghavan P.   Ruzzo W.L.   Tompa M.  

Publisher： Academic Press

ISSN： 0890-5401

Source： Information and Computation, Vol.130, Iss.2, 1996-11, pp. : 101-129

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

Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

By Williams R.  

computational complexity, Vol. 17, Iss. 2, 2008-05 ,pp. : 179-219

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Two-Agent Coordination for Graph Traversal: When Is Formation Travel Beneficial?

By Rao V.   Kabamba P.  

Journal of Optimization Theory and Applications, Vol. 130, Iss. 3, 2006-09 ,pp. : 489-503

Springer Publishing Company

Access to resources Recommend Favorite

Graph orientation and flows over time

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 3, 2015-10 ,pp. : 196-209

John Wiley & Sons Inc

Access to resources Recommend Favorite

Faster algorithm to find anti-risk path between two nodes of an undirected graph

By Mahadeokar Jay   Saxena Sanjeev  

Journal of Combinatorial Optimization, Vol. 27, Iss. 4, 2014-05 ,pp. : 798-807

Springer Publishing Company

Access to resources Recommend Favorite

Optimal Series-Parallel Trade-offs for Reducing a Function to Its Own Graph

By Beigel R.   Hemaspaandra L.A.   Hempel H.   Vogel J.  

Information and Computation, Vol. 173, Iss. 2, 2002-03 ,pp. : 123-131

Academic Press

Access to resources Recommend Favorite