Author： Fazekas Szilárd Ito Hiro Okuno Yasushi Seki Shinnosuke Taneishi Kei
Publisher： Springer Publishing Company
ISSN： 1567-7818
Source： Natural Computing, Vol.12, Iss.4, 2013-12, pp. : 589-603
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On the computational complexity of dynamic graph problems
Theoretical Computer Science, Vol. 158, Iss. 1, 1996-05 ,pp. :
Access to resources
Recommend
The complexity of pursuit on a graph
By Goldstein A.S. Reingold E.M.
Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. :
The counting complexity of group-definable languages
By Arvind V. Vinodchandran N.V.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
Comparison between the complexity of a function and the complexity of its graph
Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. :