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

doi 10.1007/978-3-540-77918-6_15
Full Text
Abstract

Available in full text

Date

Unknown

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

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Finding the K Smallest Spanning Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

The Number of Spanning Trees in Graphs With a Given Degree Sequence

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

Approximating Bounded-Degree Spanning Trees and Connected Factors With Leaves

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2017English

Laplacian Matrices and Spanning Trees of Tree Graphs

Annales de la faculté des sciences de Toulouse Mathématiques
2017English

Cubic Identity Graphs and Planar Graphs Derived From Trees

Journal of the Australian Mathematical Society
1970English

Weighted Spanning Trees on Some Self-Similar Graphs

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

Topological Paths, Cycles and Spanning Trees in Infinite Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy