The Complexity of Bottleneck Labeled Graph Problems

Author： Hassin Refael   Monnot Jérôme   Segev Danny  

Publisher： Springer Publishing Company

ISSN： 0178-4617

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

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

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

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

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

Heuristics for Semirandom Graph Problems

By Feige U.   Kilian J.  

Journal of Computer and System Sciences, Vol. 63, Iss. 4, 2001-12 ,pp. : 639-671

Academic Press

Access to resources Recommend Favorite