Connected Treewidth and Connected Graph Searching

@inproceedings{Fraigniaud2006ConnectedTA,
  title={Connected Treewidth and Connected Graph Searching},
  author={Pierre Fraigniaud and Nicolas Nisse},
  booktitle={LATIN},
  year={2006}
}
Goal In a contaminated network, an invisible omniscient arbitrary fast fugitive ; a team of searchers ; We want to find a strategy that catch the fugitive using the fewest searchers as possible. Goal In a contaminated network, an invisible omniscient arbitrary fast fugitive ; a team of searchers ; We want to find a strategy that catch the fugitive using the fewest searchers as possible. 

From This Paper

Topics from this paper.