Optimal parallel algorithms for rectilinear link-distance problems (Q1897477): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62037495 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rectilinear link distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: -Algorithms for Minimum Link Path and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear shortest paths in the presence of rectangular barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n\log n)\) algorithm for computing the link center of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the visibility polygon from a convex set and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An addendum to parallel methods for visibility and shortest-path problems in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MANHATTONIAN PROXIMITY IN A SIMPLE POLYGON / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the link center of a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching parentheses in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for rectilinear link-distance problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for minimum link paths inside a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing geodesic furthest neighbors in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01206332 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043144539 / rank
 
Normal rank

Latest revision as of 08:36, 30 July 2024

scientific article
Language Label Description Also known as
English
Optimal parallel algorithms for rectilinear link-distance problems
scientific article

    Statements

    Optimal parallel algorithms for rectilinear link-distance problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 1995
    0 references
    optimal parallel solutions
    0 references
    link-distance problems
    0 references
    parallel random access machine
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references