Approximation Algorithms for Connected Graph Factors of Minimum Weight

Theory of Computing Systems- United States

doi 10.1007/s00224-016-9723-z

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Science and Business Media LLC

Related search

New Approximation Algorithms for Graph Coloring

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1994English

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

2009Norwegian Bokmål

Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Algorithms for Generating All Possible Spanning Trees of a Simple Undirected Connected Graph: An Extensive Review

Complex & Intelligent Systems
2018English

Approximation Algorithms for Intersection Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Factor-Graph Algorithms for Equalization

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2007English

Exact Algorithms for Graph Homomorphisms

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2007English

Approximation Algorithms for Geometric Networks

English

Competitive Algorithms for Layered Graph Traversal

SIAM Journal on Computing
MathematicsComputer Science
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy