z-logo
open-access-imgOpen Access
On Finding Optimal Polytrees
Author(s) -
Serge Gaspers,
Mikko Koivisto,
Mathieu Liedloff,
Sebastian Ordyniak,
Stefan Szeider
Publication year - 2021
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - Uncategorized
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v26i1.8217
Subject(s) - parameterized complexity , bounded function , mathematics , time complexity , matroid , degree (music) , constant (computer programming) , combinatorics , discrete mathematics , polynomial , cardinality (data modeling) , intersection (aeronautics) , computer science , mathematical analysis , physics , acoustics , engineering , data mining , programming language , aerospace engineering

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