FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS (Q5696904): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: A matching problem in the plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4223058 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal Point Location in a Monotone Subdivision / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometry helps in bottleneck matching and related problems / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 17:46, 10 June 2024
scientific article; zbMATH DE number 2216278
Language | Label | Description | Also known as |
---|---|---|---|
English | FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS |
scientific article; zbMATH DE number 2216278 |
Statements
FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS (English)
0 references
19 October 2005
0 references
wireless network
0 references
mobile base stations
0 references
closest match
0 references
antipole clustering
0 references