Coloring permutation graphs in parallel (Q1613373): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4948732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum independent dominating set in a permutation graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for decision problems on the CRCW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination problems for permutation and other graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3732972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the performance of the first-fit coloring algorithm on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Comparability and Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a set of points into chains, with applications to permutation and circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generate all maximal independent sets in permutation graphs / rank
 
Normal rank

Latest revision as of 16:22, 4 June 2024

scientific article
Language Label Description Also known as
English
Coloring permutation graphs in parallel
scientific article

    Statements

    Coloring permutation graphs in parallel (English)
    0 references
    29 August 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    coloring
    0 references
    coloring permutation graphs
    0 references
    CREW PRAM model
    0 references
    coloring-permutation tree
    0 references