Login / Signup
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves.
Emmanuel Sam
Michael R. Fellows
Frances A. Rosamond
Petr A. Golovach
Published in:
CIAC (2023)
Keyphrases
</>
spanning tree
computational complexity
minimum spanning tree
minimum spanning trees
undirected graph
search algorithm
random walk
relational data
graph theory
graph structure
weighted graph
random graphs
parameterized complexity