An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs

Distributed Computing - Germany
doi 10.1007/s00446-010-0097-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Maximal K-Independent Sets in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set

2018English

New Clique and Independent Set Algorithms for Circle Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1993English

Efficient Independent Set Approximation in Unit Disk Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Exact Exponential Algorithm for Distance-3 Independent Set Problem

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

Sparse Universal Graphs for Bounded-Degree Graphs

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

The Stable Set Problem in Graphs With Bounded Genus and Bounded Odd Cycle Packing Number

2020English

Robust Maximum Weighted Independent-Set Problems on Interval Graphs

SSRN Electronic Journal
2011English

An Optimal Parallel Algorithm for Constructing a Spanning Tree on Proper Circle Trapezoid Graphs

Journal of Applied Mathematics and Physics
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy