Monotony properties of connected visible graph searching☆
Under an Elsevier user license
open archive
Keywords
Graph searching
Treewidth
Pathwidth
Cited by (0)
- ☆
A preliminary version of this paper has been presented at the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), as part of 13
- 1
Both authors received additional supports from the project “PairAPair” of the ACI Masses de Données, from the project “Fragile” of the ACI Sécurité Informatique, and from the project “Grand Large” of INRIA.
- 2
Part of this work has been done while Nicolas Nisse was at LRI, Universit Paris Sud, France. Nicolas Nisse acknowledges the support of CONICYT via Anillo en Redes ACT08, and of the European projects 1ST FET AEOLUS and COST 293 GRAAL.
Copyright © 2008 Elsevier Inc. All rights reserved.