z-logo
open-access-imgOpen Access
Some Fixed Parameter Tractability Results for Planning with Non-Acyclic Domain-Transition Graphs
Author(s) -
Christer Bäckström
Publication year - 2015
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v29i1.9648
Subject(s) - directed acyclic graph , abstraction , combinatorics , domain (mathematical analysis) , treewidth , graph , simple (philosophy) , mathematics , path (computing) , discrete mathematics , computer science , pathwidth , line graph , mathematical analysis , philosophy , epistemology , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom