Approximating Maximum Leaf Spanning Trees in Almost Linear Time

Journal of Algorithms
doi 10.1006/jagm.1998.0944
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Approximating Bounded-Degree Spanning Trees and Connected Factors With Leaves

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2017English

Approximating the Minimum Spanning Tree Weight in Sublinear Time

SIAM Journal on Computing
MathematicsComputer Science
2005English

Spanning Trees With Leaf Distance at Least Four

Journal of Graph Theory
GeometryTopology
2007English

Dynamic Low-Stretch Spanning Trees in Subpolynomial Time

2020English

Distinguishing Trees in Linear Time

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2012English

Almost-Spanning Universality in Random Graphs

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

Almost Linear Time Operations With Triangular Sets

ACM SIGSAM Bulletin
2011English

Finding Multiple Maximally Redundant Trees in Linear Time

Periodica Polytechnica Electrical Engineering
2010English

Approximating Optimal Binary Decision Trees

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy