A 4 + Ε Approximation for K-Connected Subgraphs

doi 10.1137/1.9781611975994.60
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Contractible Subgraphs in 3-Connected Graphs

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

On the Number of Connected Convex Subgraphs of a Connected Acyclic Digraph

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

On the Complexity of Partitioning a Graph Into a Few Connected Subgraphs

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2013English

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs

2017English

Discovering Hierarchical Subgraphs of K-Core-Truss

Data Science and Engineering
Computational MechanicsComputer Science Applications
2018English

On 2-Connected Spanning Subgraphs With Low Maximum Degree

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

A Modal Power Balance Approximation for Point Connected Flexural Beams

Journal of the Acoustical Society of America
AcousticsUltrasonicsArtsHumanities
1993English

Approximation Algorithms for Connected Graph Factors of Minimum Weight

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy