2-Approximation Algorithm for Finding a Spanning Tree With Maximum Number of Leaves

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-68530-8_37
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A 3/2-Approximation Algorithm for Finding Spanning Trees With Many Leaves in Cubic Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2011English

A 5/3-Approximation for Finding Spanning Trees With Many Leaves in Cubic Graphs

English

Vulnerability Bounds on the Number of Spanning Tree Leaves

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2009English

A Deterministic Approximation Algorithm for Maximum 2-Path Packing

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2010English

Approximation Algorithms for Finding Maximum Induced Expanders

2017English

Fast Algorithm for Finding Maximum Distance With Space Subdivision in E2

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Approximation Algorithm for Extended Maximum---- Concurrent Flow Problem With Saturated Capacity

2015English

On 2-Connected Spanning Subgraphs With Low Maximum Degree

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1998English

The Algorithm of Finding of K Maximum Flows

SPIIRAS Proceedings
ControlSystems EngineeringInformation SystemsComputer NetworksApplied MathematicsMathematicsCommunicationsComputer Science ApplicationsComputational TheoryComputational MathematicsArtificial Intelligence
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy