Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Locality of Some NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Locality of Distributed Symmetry Breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of Natural Semijoins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brief Announcement / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal distributed (Δ+1)-coloring algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic coin tossing with applications to optimal parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximations in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of local distributed graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Symmetry-Breaking in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved distributed algorithms for coloring interval graphs with application to multicoloring trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms for Coloring Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brief Announcement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leveraging Linial’s Locality Limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low diameter graph decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed low tree-depth decomposition algorithm for bounded expansion classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic-time deterministic network decomposition and distributed derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal maximal independent set algorithm for bounded-independence graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 07:46, 29 July 2024

scientific article
Language Label Description Also known as
English
Distributed minimum vertex coloring and maximum independent set in chordal graphs
scientific article

    Statements

    Distributed minimum vertex coloring and maximum independent set in chordal graphs (English)
    0 references
    0 references
    0 references
    13 June 2022
    0 references
    distributed algorithms
    0 references
    maximum independent set
    0 references
    minimum vertex coloring
    0 references
    approximation algorithms
    0 references
    chordal graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers