Minimum weight euclidean matching and weighted relative neighborhood graphs (Q5060141): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4763389 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding maximum matching in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and Closest-Pair Problems for a Set of Planar Discs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative neighbourhood graph of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry Helps in Matching / rank
 
Normal rank

Latest revision as of 07:47, 31 July 2024

scientific article; zbMATH DE number 7643412
Language Label Description Also known as
English
Minimum weight euclidean matching and weighted relative neighborhood graphs
scientific article; zbMATH DE number 7643412

    Statements

    Identifiers

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