Comparison between the complexity of a function and the complexity of its graph

By Durand B.   Porrot S.  

Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. : 37-46

Elsevier

Access to resources Recommend Favorite

On the Parameterized Complexity of Layered Graph Drawing

By Dujmović Vida   Fellows Michael   Kitching Matthew   Liotta Giuseppe   McCartin Catherine   Nishimura Naomi   Ragde Prabhakar   Rosamond Frances   Whitesides Sue   Wood David  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 267-292

Springer Publishing Company

Access to resources Recommend Favorite

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 the computational complexity of dynamic graph problems

By Ramalingam G.   Reps T.  

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

Elsevier

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