Causal graphs and structurally restricted planning
From MaRDI portal
Publication:988572
DOI10.1016/j.jcss.2009.10.013zbMath1197.68069MaRDI QIDQ988572
Publication date: 18 August 2010
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2009.10.013
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Tractable plan existence does not imply tractable plan generation
- Automatically generating abstractions for planning
- The computational complexity of propositional STRIPS planning
- A comparison of structural CSP decomposition methods
- Parametrized complexity theory.
- Non-dichotomies in Constraint Satisfaction Complexity
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- Depth-First Search and Linear Graph Algorithms