Login / Signup
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves.
Emmanuel Sam
Benjamin Bergougnoux
Petr A. Golovach
Nello Blaser
Published in:
FCT (2023)
Keyphrases
</>
spanning tree
edge disjoint
depth first search
total length
search algorithm
minimum spanning tree
minimum spanning trees
search strategy
minimum total cost
search tree
search space
minimum cost
branch and bound
graphical models
weighted graph
semi supervised
root node
computational complexity
decision trees