An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem☆
Under an Elsevier user license
open archive
Keywords
Exact exponential-time algorithms
NP-hard problems on directed graphs
Outbranching with a maximum number of leaves
Cited by (0)
Copyright © 2012 Elsevier B.V. All rights reserved.