Sublogarithmic Distributed MIS Algorithm for Sparse Graphs Using Nash-Williams Decomposition

Distributed Computing - Germany
doi 10.1007/s00446-009-0088-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

An Optimal Distributed Routing Algorithm Using Dual Decomposition Techniques

Communications in Information and Systems
2008English

Distributed (Δ +1)-Coloring in Sublogarithmic Rounds

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2018English

Drawing Graphs Using Modular Decomposition

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

A Fast Parallel Algorithm to Recognize P4-Sparse Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
1998English

Sparse Universal Graphs for Bounded-Degree Graphs

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

An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs

2020English

Sparse Word Graphs: A Scalable Algorithm for Capturing Word Correlations in Topic Models

2007English

Dynamic Distance Hereditary Graphs Using Split Decomposition

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Sparse Covariance Estimates for High Dimensional Classification Using the Cholesky Decomposition

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy