Skip to search formSkip to main contentSkip to account menu

Rectilinear minimum spanning tree

Known as: RMST 
In graph theory, the rectilinear minimum spanning tree (RMST) of a set of n points in the plane (or more generally, in ℝd) is a minimum spanning tree… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations

Broader (2)

Computational geometrySpanning tree
Fibonacci heapGraph theoryIntegrated circuitMinimum spanning tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Effects of Respiratory Muscle Strength Training and Shaker Exercise on Swallow Function: A Systematic Review
Oropharyngeal dysphagia is a dysfunction of swallowing which can affect the ability of a bolus to move from the oral cavity… 
2017
2017
Improving Automated Insertion Applications by Restoring Rigid-Body Condition in Point-Based Registration
2014
2014
Algorithm for the construction of Rectilinear Steiner Minimum Tree by identifying the clusters of points
The proposed algorithm constructs Rectilinear Steiner Minimum Tree (RSMT) by applying clustering algorithm to identify the… 
2012
2012
Conceptual Framework for Security Testing , Security Risk Analysis and their Combinations
Security testing and security risk analysis are key issues and central to strengthening the ability of companies to face the new… 
2009
2009
An Adaptive-Reliability Cyber-Physical Transport Protocol for Spatio-temporal Data
In this paper, we propose a new transport protocol for data collection in sensor networks that monitor physical phenomena. In a… 
2008
2008
Fault tolerant model for data dissemination in wireless sensor networks
Reliable event detection at the sink is based on collective information provided by source nodes and not on any individual report… 
2008
2008
Myotel: adressing motor behavior in neck shoulder pain by assessing and feedback semg in the daily (work) environment
Subjects with chronic pain differ in motor behavior especially with a decreased ability to relax their muscles. A myofeedback… 
2006
2006
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault… 
2005
2005
The polygonal contraction heuristic for rectilinear Steiner tree construction
Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We… 
1998
1998
Building a multicasting tree in a high-speed network
To build a multicasting tree in a multicomputer network, the authors propose three strategies based on voting constructing a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)