Publication | Closed Access

Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs

Mathematical ProgrammingBottleneck CasesEngineeringGraph TheoryProbabilistic Graph TheoryExtremal Graph TheoryStructural Graph TheoryDegree-3 GraphsNetwork AnalysisEducationComputational ComplexityExtremal CombinatoricsComputer ScienceDiscrete MathematicsCombinatorial OptimizationGraph Algorithm