| Document Date: 2007-01-17 10:04:40
Open Document File Size: 189,51 KBShare Result on Facebook
City Bergen / Orsay / Paris / / Country Norway / France / / / Event Product Issues / / Facility University of Bergen / / IndustryTerm search program wins / search strategies / nondeterministic search number / important tools / search program / nondeterministic search number sq / nondeterministic search number s∞ / exponential-time solutions / exponential-time algorithms / search game / search step / search starting / search steps / nondeterministic search steps / approximation algorithm / linear time algorithm / binary search / polynomial time algorithm / algorithm computing / exponential algorithm / search strategy / search number / search strategy corresponding / computing / nondeterministic search program / graph algorithms / search games / search models / visible-search number / / Organization Department of Informatics / University of Bergen / / Product vertex / vertices / / ProgrammingLanguage TSP / / Technology graph algorithms / exponential-time algorithms / polynomial time algorithm / approximation algorithm / linear time algorithm / known exponential algorithm / /
SocialTag |
Nondeterministic Graph Searching: From Pathwidth to Treewidth Fedor V. Fomin1 , Pierre Fraigniaud2 , and Nicolas Nisse2