On maximum flows in polyhedral domains (Q918212): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Visibility of disjoint polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal shortest path queries in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Flow in Planar Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Medial Axis Transformation of a Planar Shape / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Discrete Geodesic Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for shortest-path motion in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal flow through a domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 10:13, 21 June 2024

scientific article
Language Label Description Also known as
English
On maximum flows in polyhedral domains
scientific article

    Statements

    On maximum flows in polyhedral domains (English)
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    computation of maximum flows
    0 references
    shortest paths problems
    0 references