Computing the map of geometric minimal cuts (Q476438): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s00453-012-9704-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059004575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial property of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``The big sweep'': On the power of the wavefront approach to Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making data structures persistent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper envelope of piecewise linear functions: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsification—a technique for speeding up dynamic graph algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concrete and abstract Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Voronoi diagrams revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized incremental construction of abstract Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling to provide or to bound: With applications to fully dynamic graph algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic fractional cascading / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hausdorff Voronoi diagram of point clusters in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE L<sub>∞</sub> VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal fully-dynamic graph connectivity / rank
 
Normal rank

Latest revision as of 08:42, 9 July 2024

scientific article
Language Label Description Also known as
English
Computing the map of geometric minimal cuts
scientific article

    Statements

    Computing the map of geometric minimal cuts (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    geometric minimal cut
    0 references
    Hausdorff Voronoi diagram
    0 references
    output sensitive algorithm
    0 references
    plane sweep algorithm
    0 references
    computational geometry
    0 references

    Identifiers

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