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

Nondeterministic Graph Searching: From Pathwidth to Treewidth

By Fomin Fedor   Fraigniaud Pierre   Nisse Nicolas  

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

Springer Publishing Company

Access to resources Recommend Favorite

Graph extension with constant connectivity

By Ido Hideshi   Omatu Sigeru  

Artificial Life and Robotics, Vol. 10, Iss. 2, 2006-11 ,pp. : 189-193

Springer Publishing Company

Access to resources Recommend Favorite

Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph

By Guo Dan  

Applied Intelligence, Vol. 39, Iss. 1, 2013-07 ,pp. : 57-74

Springer Publishing Company

Access to resources Recommend Favorite

Constant Time Graph Algorithms on the Reconfigurable Multiple Bus Machine

By Trahan J.L.   Vaidyanathan R.   Subbaraman C.P.  

Journal of Parallel and Distributed Computing, Vol. 46, Iss. 1, 1997-10 ,pp. : 1-14

Academic Press

Access to resources Recommend Favorite