Graph Decomposition for Memoryless Periodic Exploration

ISSN： 0178-4617

Source： Algorithmica, Vol.63, Iss.1-2, 2012-06, pp. : 26-38

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

Exploration of Web Page Structural Patterns Based on Request Dependency Graph Decomposition

International Journal of Digital Crime and Forensics (IJDCF), Vol. 8, Iss. 4, 2016-10 ,pp. : 1-13

IGI Global_journal

Access to resources Recommend Favorite

On memoryless provers and insincere verifiers

By Subramani K.

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 21, Iss. 3, 2009-09 ,pp. : 217-231

Taylor & Francis Ltd

Access to resources Recommend Favorite

Automatic Design of Application Specific Instruction Set Extensions Through Dataflow Graph Exploration: Workshop on Application Specific Processors (WASP)

By Clark Nathan Zhong Hongtao Tang Wilkin Mahlke Scott

International Journal of Parallel Programming, Vol. 31, Iss. 6, 2003-12 ,pp. : 429-449

Springer Publishing Company

Access to resources Recommend Favorite

A fast memoryless interval-based algorithm for global optimization

By Sun M.

Journal of Global Optimization, Vol. 47, Iss. 2, 2010-06 ,pp. : 247-271

Springer Publishing Company

Access to resources Recommend Favorite

Memoryless determinacy of parity and mean payoff games: a simple proof

By Bjorklund H. Sandberg S. Vorobyov S.

Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. : 365-378

Elsevier

Access to resources Recommend Favorite