Article citationsMore>>

Bienstock, D. (1989) Graph Searching, Path-Width, Tree-Width and Related Problems (a Survey). In Reliability of Computer and Communication Networks, Vol. 5 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 33-50.

has been cited by the following article:

Follow SCIRP
Twitter Facebook Linkedin Weibo
Contact us
Free SCIRP Newsletters
Copyright © 2006-2021 Scientific Research Publishing Inc. All Rights Reserved.