An optimal parallel algorithm for planar cycle separators (Q1900892): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57761204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple parallel tree contraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random NC algorithm for depth first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Depth-First Search in General Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Euler tours in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster optimal parallel prefix sums and list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for dynamic expression evaluation and context-free recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Depth-First Search in $O(\log n)$ Parallel Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for series parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for planar graph isomorphism and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Strong Connectivity Helps in Parallel Depth-First Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small simple cycle separators for 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Tree Contraction Part 2: Further Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first search is inherently sequential / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-processor algorithm for depth-first search in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Depth-First Searches I. Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216652 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:52, 23 May 2024

scientific article
Language Label Description Also known as
English
An optimal parallel algorithm for planar cycle separators
scientific article

    Statements

    An optimal parallel algorithm for planar cycle separators (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 October 1995
    0 references
    0 references
    optimal parallel algorithm
    0 references
    cycle separator
    0 references
    planar undirected graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references