Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
From MaRDI portal
Recommendations
- Brief announcement: Distributed minimum vertex coloring and maximum independent set in chordal graphs
- Distributed minimum vertex coloring and maximum independent set in chordal graphs
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
- Distributed algorithms for coloring interval graphs
Cites work
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A fast network-decomposition algorithm and its applications to constant-time distributed computation (extended abstract)
- A new technique for distributed symmetry breaking
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A time hierarchy theorem for the LOCAL model
- An Improved Distributed Algorithm for Maximal Independent Set
- An optimal distributed (+1)-coloring algorithm?
- An optimal maximal independent set algorithm for bounded-independence graphs
- Brief Announcement
- Brief announcement: Distributed minimum vertex coloring and maximum independent set in chordal graphs
- Deterministic \(({\delta} + 1)\)-coloring in sublinear (in \({\delta}\)) time in static, dynamic and faulty networks
- Deterministic coin tossing with applications to optimal parallel list ranking
- Distributed \((\Delta+1)\)-coloring in sublogarithmic rounds
- Distributed algorithms for coloring interval graphs
- Distributed Coloring in Sparse Graphs with Fewer Colors
- Fast Distributed Approximations in Planar Graphs
- Fast randomized algorithms for distributed edge coloring (extended abstract)
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
- Improved distributed delta-coloring
- Leveraging Linial’s Locality Limit
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Locality in Distributed Graph Algorithms
- Low diameter graph decompositions
- On the complexity of local distributed graph problems
- On the locality of some NP-complete problems
- Parallel Symmetry-Breaking in Sparse Graphs
- Power of Natural Semijoins
- Reducibility among combinatorial problems
- Simple and near-optimal distributed coloring for sparse graphs
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- The local nature of \(\Delta\)-coloring and its algorithmic applications
- The locality of distributed symmetry breaking
- Tree-decompositions with bags of small diameter
This page was built for publication: Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092380)
