An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs (Q3464472): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q244219
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Christos D. Zaroliagis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-24024-4_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1828874726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms with Optimal Speedup for Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for some graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Connected Components in O(log n log log n) Time on the EREW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent threads and optimal parallel minimum spanning trees 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: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / 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 algorithms on planar 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: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Algorithm for Computing Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal minimum spanning tree algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest / rank
 
Normal rank

Latest revision as of 08:56, 11 July 2024

scientific article
Language Label Description Also known as
English
An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs
scientific article

    Statements

    An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs (English)
    0 references
    0 references
    0 references
    27 January 2016
    0 references

    Identifiers