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:
CoRR (2023)
Keyphrases
</>
spanning tree
edge disjoint
depth first search
total length
minimum spanning tree
minimum spanning trees
search algorithm
branch and bound
search tree
minimum total cost
minimum cost
search strategy
weighted graph
undirected graph
edge weights
alpha beta