๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs

โœ Scribed by C. Rhee; Y.Daniel Liang; S.K. Dhall; S. Lakshmivarahan


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
512 KB
Volume
49
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


New efficient breadth-first/level traver
โœ Duy Quang Nguyen; Miguel J. Bagajewicz ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› American Institute of Chemical Engineers ๐ŸŒ English โš– 427 KB ๐Ÿ‘ 2 views

## Abstract This work studies the problem of optimally locating sensors for monitoring chemical processes, formally known as the sensor network design and upgrade problem. This problem is an integer programming problem and has been solved to global optimality only using tree search methods using de