Nondeterministic Graph Searching: From Pathwidth to Treewidth

Author： Fomin Fedor   Fraigniaud Pierre   Nisse Nicolas  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.53, Iss.3, 2009-03, pp. : 358-373

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

Diameter and Treewidth in Minor-Closed Graph Families, Revisited

By Demaine Erik D.   Hajiaghayi Mohammad Taghi  

Algorithmica, Vol. 40, Iss. 3, 2004-08 ,pp. : 211-215

Springer Publishing Company

Access to resources Recommend Favorite

Constant-Degree Graph Expansions that Preserve Treewidth

By Markov Igor   Shi Yaoyun  

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 461-470

Springer Publishing Company

Access to resources Recommend Favorite

The cost of monotonicity in distributed graph searching

By Ilcinkas David  

Distributed Computing, Vol. 22, Iss. 2, 2009-10 ,pp. : 117-127

Springer Publishing Company

Access to resources Recommend Favorite

Interfacing Software Libraries from Nondeterministic Prototypes

By Chachkov Stanislav   Buchs Didier  

Design Automation for Embedded Systems, Vol. 8, Iss. 4, 2003-12 ,pp. : 327-343

Springer Publishing Company

Access to resources Recommend Favorite

Graph Searching, Elimination Trees, and a Generalization of Bandwidth

By Fomin Fedor V.   Heggernes Pinar   Telle Jan Arne  

Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. : 73-87

Springer Publishing Company

Access to resources Recommend Favorite