Related references
Note: Only part of the references are listed.Beyond two-point statistics: using the minimum spanning tree as a tool for cosmology
Krishna Naidoo et al.
MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY (2020)
A FULLY DYNAMIC REACHABILITY ALGORITHM FOR DIRECTED GRAPHS WITH AN ALMOST LINEAR UPDATE TIME
Liam Roditty et al.
SIAM JOURNAL ON COMPUTING (2016)
Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks
Maleq Khan et al.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2009)
Using the minimum spanning tree to trace mass segregation
Richard J. Allison et al.
MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY (2009)
Spanning tree based algorithms for low latency and energy efficient data aggregation enhanced convergecast (DAC) in wireless sensor networks
S. Upadhyayula et al.
AD HOC NETWORKS (2007)
Dynamic optimality - Almost
Erik D. Demaine et al.
SIAM JOURNAL ON COMPUTING (2007)
Function matching for Soviet-era table-based modified polyconic projections
IO Bildirici et al.
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE (2006)
Efficient regionalization techniques for socio-economic geographical units using minimum spanning trees
R. M. Assuncao et al.
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE (2006)
Lowest common ancestors in trees and directed acyclic graphs
MA Bender et al.
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC (2005)
Share Paper
