Finding Minimum Spanning Forests in Logarithmic Time and Linear Work Using Random Sampling

doi 10.1145/237502.237563
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Approximating the Minimum Spanning Tree Weight in Sublinear Time

SIAM Journal on Computing
MathematicsComputer Science
2005English

A Randomly Weighted Minimum Spanning Tree With a Random Cost Constraint

2020English

Approximating Maximum Leaf Spanning Trees in Almost Linear Time

Journal of Algorithms
1998English

Finding Motifs Using Random Projections

Journal of Computational Biology
GeneticsMolecular BiologyComputational TheorySimulationComputational MathematicsMathematicsModeling
2002English

Finding Multiple Maximally Redundant Trees in Linear Time

Periodica Polytechnica Electrical Engineering
2010English

Generalized Minimum Spanning Tree Games

EURO Journal on Computational Optimization
ControlSimulationManagement ScienceOptimizationModelingComputational MathematicsOperations Research
2015English

Almost-Spanning Universality in Random Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2016English

Node Sampling Using Random Centrifugal Walks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

To Find Energy Efficient Protocol by Using Minimum Spanning Tree

International Journal of Computer Applications
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy