Pages that link to "Item:Q1141155"
From MaRDI portal
The following pages link to The relative neighbourhood graph of a finite planar set (Q1141155):
Displaying 44 items.
- A continuous strategy for collisionless gathering (Q2220827) (← links)
- An investigation of new graph invariants related to the domination number of random proximity catch digraphs (Q2276421) (← links)
- Physarum in silicon: the Greek motorways study (Q2311224) (← links)
- New sequential and parallel algorithms for computing the \(\beta\)-spectrum (Q2348036) (← links)
- 10-Gabriel graphs are Hamiltonian (Q2353639) (← links)
- The approximate rectangle of influence drawability problem (Q2354030) (← links)
- Population-driven urban road evolution dynamic model (Q2358046) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Local solutions for global problems in wireless networks (Q2466005) (← links)
- A new family of proximity graphs: class cover catch digraphs (Q2506361) (← links)
- The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association (Q2573988) (← links)
- A graph-theoretical clustering method based on two rounds of minimum spanning trees (Q2654240) (← links)
- $$\beta $$-skeletons for a Set of Line Segments in $$R^2 $$ (Q2947870) (← links)
- Lens data depth and median (Q3106442) (← links)
- Complexity, convexity, and unimodality (Q3219150) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- On the expected maximum degree of Gabriel and Yao graphs (Q3558941) (← links)
- Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations (Q3628371) (← links)
- ON THE LONGEST RNG EDGE OF WIRELESS AD HOC NETWORKS (Q3634202) (← links)
- Growing spanning trees in plasmodium machines (Q3639316) (← links)
- An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics (Q3773333) (← links)
- Structure-activity maps for visualizing the graph variables arising in drug design (Q4298674) (← links)
- On Vertex- and Empty-Ply Proximity Drawings (Q4625098) (← links)
- Drawing Big Graphs Using Spectral Sparsification (Q4625115) (← links)
- Constructing competitive tours from local information (Q4630252) (← links)
- Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests (Q4915648) (← links)
- Comparison of Proximity Measures for a Topological Discrimination (Q5016647) (← links)
- Depth functions and mutidimensional medians on minimal spanning trees (Q5036984) (← links)
- A Continuous Strategy for Collisionless Gathering (Q5056062) (← links)
- A linear-time construction of the relative neighborhood graph within a histogram (Q5057436) (← links)
- Minimum weight euclidean matching and weighted relative neighborhood graphs (Q5060141) (← links)
- Odd Yao-Yao Graphs are Not Spanners (Q5115817) (← links)
- PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING (Q5311630) (← links)
- Position-Based Routing in Wireless Ad Hoc and Sensor Networks (Q5391126) (← links)
- A new family of random graphs for testing spatial segregation (Q5421209) (← links)
- Time-optimum packet scheduling for many-to-one routing in wireless sensor networks (Q5421614) (← links)
- RNG RELAY SUBSET FLOODING PROTOCOLS IN MOBILE AD-HOC NETWORKS (Q5696907) (← links)
- Essential Constraints of Edge-Constrained Proximity Graphs (Q5890863) (← links)
- Fast algorithms for computing \(\beta\)-skeletons and their relatives. (Q5948530) (← links)
- Weighted \({\mathcal A}\)-shape: A descriptor of the shape of a point set (Q5950287) (← links)
- Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes (Q6066057) (← links)
- Shape-faithful graph drawings (Q6117038) (← links)
- Mutual witness proximity drawings of isomorphic trees (Q6560156) (← links)
