On the computational complexity of dynamic graph problems

Author： Ramalingam G.   Reps T.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.158, Iss.1, 1996-05, pp. : 233-277

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

The Complexity of Bottleneck Labeled Graph Problems

By Hassin Refael   Monnot Jérôme   Segev Danny  

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 245-262

Springer Publishing Company

Access to resources Recommend Favorite

On computational complexity of graph inference from counting

By Fazekas Szilárd   Ito Hiro   Okuno Yasushi   Seki Shinnosuke   Taneishi Kei  

Natural Computing, Vol. 12, Iss. 4, 2013-12 ,pp. : 589-603

Springer Publishing Company

Access to resources Recommend Favorite

Computational complexity of some problems involving congruences on algebras

By Bergman C.   Slutzki G.  

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 591-608

Elsevier

Access to resources Recommend Favorite

The Computational Complexity of Some Problems of Linear Algebra

By Buss J.F.   Frandsen G.S.   Shallit J.O.  

Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. : 572-596

Academic Press

Access to resources Recommend Favorite

The complexity of pursuit on a graph

By Goldstein A.S.   Reingold E.M.  

Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. : 93-112

Elsevier

Access to resources Recommend Favorite