Login / Signup
Efficiently Computing Directed Minimum Spanning Trees.
Maximilian Böther
Otto Kißig
Christopher Weyand
Published in:
ALENEX (2023)
Keyphrases
</>
efficiently computing
minimum spanning trees
minimum spanning tree
spanning tree
olap data cubes
neighborhood graph
genetic algorithm
feature selection
data structure
data analysis
data points
shortest path
edge weights