An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Marek Chrobak / rank
 
Normal rank
Property / author
 
Property / author: Joseph (Seffi) Naor / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear 5-coloring algorithm of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear-time algorithms for five-coloring planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete 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: Optimal Parallel 5-Colouring of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel coloring of planar graphs with five colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Coloring the Lines of a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Algorithm for Colouring Planar Graphs with Five Colours / rank
 
Normal rank

Latest revision as of 17:16, 21 June 2024

scientific article
Language Label Description Also known as
English
An efficient parallel algorithm for computing a large independent set in a planar graph
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references