z-logo
open-access-imgOpen Access
Finding Diverse Trees, Paths, and More
Author(s) -
Tesshu Hanaka,
Yasuaki Kobayashi,
Kazuhiro Kurita,
Yota Otachi
Publication year - 2021
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.v35i5.16495
Subject(s) - vertex cover , pairwise comparison , treewidth , mathematics , combinatorics , vertex (graph theory) , combinatorial optimization , bounded function , hamming distance , time complexity , discrete mathematics , graph , mathematical optimization , computer science , pathwidth , line graph , mathematical analysis , statistics

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