Search references for DISTRIBUTED MINIMUM-SPANNING-TREE. Phrases containing DISTRIBUTED MINIMUM-SPANNING-TREE
See searches and references containing DISTRIBUTED MINIMUM-SPANNING-TREE!DISTRIBUTED MINIMUM-SPANNING-TREE
Least-weight tree connecting graph vertices
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all
Minimum_spanning_tree
The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where
Distributed minimum spanning tree
Distributed_minimum_spanning_tree
Shortest network connecting points
A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system
Euclidean minimum spanning tree
Euclidean_minimum_spanning_tree
In mathematics, a random minimum spanning tree may be formed by assigning independent random weights from some distribution to the edges of an undirected
Random_minimum_spanning_tree
Tree which includes all vertices of a graph
graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree (see about spanning forests below). If all of
Spanning_tree
Method for finding minimum spanning trees
algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every
Prim's_algorithm
Network protocol that builds a loop-free logical topology for Ethernet networks
The Spanning Tree Protocol (STP) is a network protocol that builds a loop-free logical topology for Ethernet networks. The basic function of STP is to
Spanning_Tree_Protocol
Network protocol that builds a loop-free logical topology for Ethernet networks
it is recommended to use distributed load ARP servers, although their use is not compulsory. Distributed minimum spanning tree EtherChannel Ethernet Automatic
Multiple Spanning Tree Protocol
Multiple_Spanning_Tree_Protocol
In graph theory a minimum spanning tree (MST) T {\displaystyle T} of a graph G = ( V , E ) {\displaystyle G=(V,E)} with | V | = n {\displaystyle |V|=n}
Parallel algorithms for minimum spanning trees
Parallel_algorithms_for_minimum_spanning_trees
On short connecting nets with added points
tree problem in graphs is equivalent to the minimum spanning tree. However, while both the non-negative shortest path and the minimum spanning tree problem
Steiner_tree_problem
Minimum spanning forest algorithm that greedily adds edges
algorithm finds a minimum spanning forest of an undirected edge-weighted graph. If the graph is connected, it finds a minimum spanning tree. It is a greedy
Kruskal's_algorithm
Topics referred to by the same term
containing spanning tree Minimum spanning tree Capacitated minimum spanning tree Distributed minimum spanning tree Euclidean minimum spanning tree k-minimum spanning
Spanning tree (disambiguation)
Spanning_tree_(disambiguation)
Index of articles associated with the same name
and using the minimum spanning tree for those weights Random binary tree, binary trees with various random distributions, including trees formed by random
Random_tree
Method for finding minimum spanning trees
algorithm is a greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected
Borůvka's_algorithm
Algorithm for the directed version of the minimum spanning tree problem
finding a spanning arborescence of minimum weight (sometimes called an optimum branching). It is the directed analog of the minimum spanning tree problem
Edmonds'_algorithm
Area of discrete mathematics
selected. Being a spanning tree means that a subgraph is a tree that includes all of the vertices of a graph. The uniform spanning tree can be generated
Graph_theory
Czech academic and mathematician
mathematically as a minimum spanning tree problem, and described the first known algorithm for finding the minimum spanning tree of a metric space (the
Otakar_Borůvka
System with multiple networked computers
A. Humblet, and P. M. Spira (January 1983). "A Distributed Algorithm for Minimum-Weight Spanning Trees" (PDF). ACM Transactions on Programming Languages
Distributed_computing
Probability distribution on equally likely outcomes
set and a uniform spanning tree of a graph is a spanning tree selected with uniform probabilities from the full set of spanning trees of the graph. The
Discrete_uniform_distribution
Leader election algorithm
"A distributed algorithm for minimum spanning tree" (PDF). Massachusetts Institute of Technology. Awerbuch, Baruch (1987). "Optimal Distributed Algorithm
Yo-yo_(algorithm)
Overview of and topical guide to algorithms
Floyd–Warshall algorithm Johnson's algorithm A* search algorithm Minimum spanning tree Kruskal's algorithm Prim's algorithm Borůvka's algorithm Connected
Outline_of_algorithms
American computer scientist
Monte Carlo method to compute the minimum cut of a connected graph. Karger developed the fastest minimum spanning tree algorithm to date, with Philip Klein
David_Karger
Tree graph with one central node and leaves of length 1
F.; Raidl, G. R. (2001), "Prüfer numbers: A poor representation of spanning trees for evolutionary search" (PDF), GECCO-2001: Proceedings of the Genetic
Star_(graph_theory)
Cycles in a graph that generate all cycles
forms a cycle basis. The minimum weight cycle basis of a planar graph corresponds to the Gomory–Hu tree of the dual graph. A spanning subgraph of a given graph
Cycle_basis
Python module
as graph isomorphism, subgraph isomorphism, minimum spanning tree, connected components, dominator tree, maximum flow, etc. Support for several centrality
Graph-tool
Distributed algorithm in graph theory
by alliances or by conquering/absorption. Mega-Merger builds a minimum spanning tree over connected graphs provided: Total reliability: No message is
Mega-Merger
must distributedly choose values for a set of variables such that the cost of a set of constraints over the variables is minimized. Distributed Constraint
Distributed constraint optimization
Distributed_constraint_optimization
Sequence of locally optimal choices
algorithm and Prim's algorithm are greedy algorithms for constructing minimum spanning trees of a given connected graph. They always find an optimal solution
Greedy_algorithm
Geometric graph connecting nearby points
subgraph of the Delaunay triangulation. In turn, the Euclidean minimum spanning tree is a subgraph of it, from which it follows that it is a connected
Relative_neighborhood_graph
Computing technique
resulting graphs. It is a basic technique in distributed algorithms. For instance, a (minimum) spanning tree is used as a backbone to reduce the cost of
Topology_control
contain the Euclidean minimum spanning tree; therefore, the β-skeleton also contains the Gabriel graph and the minimum spanning tree whenever β ≤ 1. For
Beta_skeleton
Mathematical optimization problem restricted to integers
{\displaystyle d} of A {\displaystyle A} is the minimum of the tree-depth of the graph of A {\displaystyle A} and the tree-depth of the graph of the transpose of
Integer_programming
Computer science data structure
reduced by polynomial order. Examples of such problems are Prim's minimal-spanning-tree algorithm and Dijkstra's shortest-path algorithm. Priority queue: A
Heap_(data_structure)
approximation. spanning A subgraph is spanning when it includes all of the vertices of the given graph. Important cases include spanning trees (spanning subgraphs
Glossary_of_graph_theory
Design technique for parallel algorithms
algorithms for finding the roots of a forest of rooted trees, connected components, minimum spanning trees, and biconnected components. However, pointer jumping
Pointer_jumping
algorithm): find maximum or minimum branchings Euclidean minimum spanning tree: algorithms for computing the minimum spanning tree of a set of points in the
List_of_algorithms
Abstract data type in computer science
Using min heap priority queue in Prim's algorithm to find the minimum spanning tree of a connected and undirected graph, one can achieve a good running
Priority_queue
Data structure
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, Journal of the ACM, Vol. 48 Issue 4(July
Top_tree
Optimizing objective functions that have constrained variables
is then placed in the appropriate bucket. Constrained least squares Distributed constraint optimization Constraint satisfaction problem (CSP) Constraint
Constrained_optimization
Class of algorithms for solving constrained optimization problems
Conference on Machine Learning. PMLR. pp. 80–88. Boyd, Stephen (2010). "Distributed Optimization and Statistical Learning via the Alternating Direction Method
Augmented_Lagrangian_method
Collective behavior of decentralized, self-organized systems
Potential Fields approach is distributed since the force calculations and motion control can be done in an asynchronous and distributed manner. Using specially
Swarm_intelligence
Optimization algorithm
Partition problem (SPP) Weight constrained graph tree partition problem (WCGTPP) Arc-weighted l-cardinality tree problem (AWlCTP) Multiple knapsack problem
Ant colony optimization algorithms
Ant_colony_optimization_algorithms
Filtering Decision stumps (one-level decision trees) Density Estimation Trees Euclidean minimum spanning trees Gaussian Mixture Models (GMMs) Hidden Markov
Mlpack
Algorithm which can do multiple operations in a given time
Parallel algorithms for matrix multiplication Parallel algorithms for minimum spanning trees Parallel computing Parareal Blelloch, Guy E.; Maggs, Bruce M. "Parallel
Parallel_algorithm
Concept in distributed computing
A. Humblet, and P. M. Spira (January 1983). "A Distributed Algorithm for Minimum-Weight Spanning Trees" (PDF). ACM Transactions on Programming Languages
Leader_election
Optimization technique
multiple metaheuristic searches in parallel; these may range from simple distributed schemes to concurrent search runs that interact to improve the overall
Metaheuristic
Form of Newton's method used in statistics
Y_{1},\ldots ,Y_{n}} be random variables, independent and identically distributed with twice differentiable p.d.f. f ( y ; θ ) {\displaystyle f(y;\theta
Scoring_algorithm
NP-hard problem in combinatorial optimization
For example, the minimum spanning tree of the graph associated with an instance of the Euclidean TSP is a Euclidean minimum spanning tree, and so can be
Travelling_salesman_problem
IEEE standard for Shortest Path Bridging
while enabling multipath routing. SPB is designed to replace the older Spanning Tree Protocols: IEEE 802.1D STP, IEEE 802.1w RSTP, and IEEE 802.1s MSTP.
IEEE_802.1aq
Concept in convex optimization mathematics
decomposition techniques. Such decomposition methods often allow a simple distributed method for a problem. Let f : R n → R {\displaystyle f:\mathbb {R} ^{n}\to
Subgradient_method
Algorithm for partial ordering of events and detecting causality in distributed systems
in a distributed system (unpublished). Liskov, Barbara; Ladin, Rivka (1986). "Highly available distributed services and fault-tolerant distributed garbage
Vector_clock
number of edges, and total weight close to that of the Euclidean minimum spanning tree. Although known construction methods for them are slow, fast approximation
Greedy_geometric_spanner
Combinatorial optimization problem
vertices, in place of a star, is called the minimax path problem. Minimum-diameter spanning tree Minsum facility location (1-median problem), with geometric
1-center_problem
Algorithm in computer science
number of solutions in the population. At the first step, a randomly distributed initial population (food source positions) is generated. After initialization
Artificial bee colony algorithm
Artificial_bee_colony_algorithm
Mathematical algorithm
algorithm that successively minimizes along coordinate directions to find the minimum of a function. At each iteration, the algorithm determines a coordinate
Coordinate_descent
Inverse function to a tower of powers
Delaunay triangulation of a set of points knowing the Euclidean minimum spanning tree: randomized O(n log* n) time. Fürer's algorithm for integer multiplication:
Iterated_logarithm
Optimization algorithm
genetic replacement of abandoned nests applied to optimal allocation of distributed generation units". IET Generation, Transmission & Distribution. 12 (13):
Cuckoo_search
Algorithm in mathematical optimization
using dynamic trees, although in practice it is less efficient.[citation needed] The push–relabel algorithm has been extended to compute minimum cost flows
Push–relabel maximum flow algorithm
Push–relabel_maximum_flow_algorithm
Management card for modular switches
of CEF tables thanks to dCEF. Abridged list of features: 802.1q VLAN Spanning Tree Protocol Ether Channel Jumbo Frames (E)IGRP, OSPF, RIP (2), Static Routing
Supervisor_Engine_(Cisco)
Mathematical model of memory
uniformly distributed in the virtual space, to mimic the existence of the larger virtual space as accurately as possible. Every datum is stored distributed by
Sparse_distributed_memory
Use of multiple antennas in radio
introduced: The modified best-first (MBF) tree search transforms the M-ary search tree into a binary tree using a first-child/next-sibling structure
MIMO
based on the five postcranial shape variables and its associated minimum spanning tree are shown in Figure 4.[clarification needed] Recent African groups
Black-American_anthropology
Form taken by the network of interconnections of a circuit
article, spanning tree is meant by an unqualified tree unless otherwise stated. A given network graph can contain a number of different trees. The branches
Circuit_topology_(electrical)
Israeli computer scientist
Lotker, Z., Patt-Shamir, B., Pavlov, E., & Peleg, D. (2005). Minimum-weight spanning tree construction in O (log log n) communication rounds. SIAM Journal
Zvi_Lotker
File system that allows many clients to have access
files in a hierarchical tree, where the nodes represent directories. There are several ways to share files in a distributed architecture: each solution
Distributed file system for cloud
Distributed_file_system_for_cloud
Large Christmas tree near the White House in Washington, D.C.
The National Christmas Tree is a large evergreen tree located in the northeast quadrant of the Ellipse near the White House in Washington, D.C. Each year
National Christmas Tree (United States)
National_Christmas_Tree_(United_States)
1999 Microsoft operating system version
including the Microsoft Distributed File System (DFS), Active Directory support and fault-tolerant storage. The Distributed File System (DFS) allows
Windows_2000
the distributed (or coarse grain) and cellular (or fine grain) algorithms are very popular optimization procedures. In the case of distributed ones,
Parallel_metaheuristic
Class of woods from trees in the genus Santalum
levels of fragrance oils requires Indian sandalwood (S. album) trees to be a minimum of 15 years old – the yield, quality and volume are yet to be clearly
Sandalwood
Network representing spatial objects
structure of edges it is useful to find the Minimum spanning tree, or the generalization, the Steiner tree and the relative neighborhood graph. In the
Spatial_network
Set of standards under development by the IEEE for real-time networking
redundancy, and distribute flow synchronization and flow control messages. These are derived from Equal Cost Tree (ECT), Multiple Spanning Tree Instance (MSTI)
Time-Sensitive_Networking
South Carolina family
included acts of fraud, corruption, embezzlement, theft and drug offenses spanning decades and involving dozens of victims, many of whom were disadvantaged
Murdaugh_family
Triangulation method
paired with a final iterative triangle flipping step. The Euclidean minimum spanning tree of a set of points is a subset of the Delaunay triangulation of
Delaunay_triangulation
U.S. state
of Christmas trees and Christmas wreaths annually. Its 370 Christmas tree farms produce roughly 100,000 trees each year. The Christmas tree industry in
Maine
Climatic cooling after the Medieval Warm Period (16th–19th centuries)
reservoirs such as tree rings and ice sheets. In the intervals 1400–1550 (the Spörer Minimum) and 1645–1715 (the Maunder Minimum) there were very low
Little_Ice_Age
the Pierre Shale on the Cedar Creek Anticline (Montana, United States) spanning the Campanian-Maastrichtian boundary on the basis of the study of geochemical
2026_in_paleontology
Project in integrated circuit design
higher-density 7 nm layers. Finally, OpenROAD has been assessed for processes spanning single-digit nanometer (nm) projections to more than 100 nm. Once the suitable
OpenROAD_Project
Province of Canada
limited to the provincially owned GO Transit, and serves a train-bus network spanning the Golden Horseshoe region, with Union Station in Toronto serving as the
Ontario
made the $1-an-hour pay rise for the nation's lowest paid workers on the minimum wage a core part of his election campaign to tackle the cost of living
List of The Weekly with Charlie Pickering episodes
List_of_The_Weekly_with_Charlie_Pickering_episodes
American reality television series (2012–2016)
him and Carlos with the business, and poaching Kiel by lying that the minimum number of people per party that Lenny is willing to cater is 50, when it
Mystery_Diners
complex and non-linear relationships. More recently, two dimensional minimum spanning tree layouts have been used to guide the manual gating process. Density-based
Flow_cytometry_bioinformatics
President of the United States from 2021 to 2025
tax credit. Biden's initial proposal included an increase of the federal minimum wage to $15 per hour, but after the Senate parliamentarian determined that
Joe_Biden
Ongoing armed conflict in the Middle East
4.74 litres per person per day, just under a third of the recommended minimum in emergencies. Doctors warned of disease outbreaks spreading due to overcrowded
Gaza_war
Network that allows computers to share resources and communicate with each other
bridging (IEEE 802.1D) deals with the routing of Ethernet packets using a Spanning Tree Protocol. IEEE 802.1Q describes VLANs, and IEEE 802.1X defines a port-based
Computer_network
Mapping arbitrary data to fixed-size values
(2013). "Keyless Signatures' Infrastructure: How to Build Global Distributed Hash-Trees". In Riis, Nielson H.; Gollmann, D. (eds.). Secure IT Systems. NordSec
Hash_function
American businessman (1897–1992)
Though he was one of the wealthiest tycoons of his day, with operations spanning 23 countries, Ludwig remained completely obscure due to his reclusive lifestyle
Daniel_K._Ludwig
Fibrous material from trees or other plants
H.; Hantemirov (2008). "Trends in recent temperature and radial tree growth spanning 2000 years across northwest Eurasia". Philosophical Transactions
Wood
Stratovolcano in Oregon, United States
around Crater Rock and crosses the Coalman Glacier on the Hogsback, a ridge spanning from Crater Rock to the approach to the summit. The Hogsback terminates
Mount_Hood
basic cable runs. The Seattle Mariners also had their local broadcasts distributed by MLB Local Media beginning in 2026; the Mariners announced their move
2026_in_American_television
Methodic assignment of colors to elements of a graph
within a polynomial factor of the number t ( G ) {\displaystyle t(G)} of spanning trees of the input graph. In practice, branch and bound strategies and graph
Graph_coloring
from a minimum of 4 °C (39 °F) to a maximum of 40 °C (104 °F). Good rainfall conditions are essential for its growth, say a well distributed annual rainfall
Areca_nut_production_in_India
Steep-sided canyon in Arizona, US
scrub community. Except for the western banded gecko, which seems to be distributed only near water along the Colorado River, all of the reptiles found near
Grand_Canyon
Behind Tom Hanks Wildlife Docuseries 'The Americas' Tease 'The Biggest Trees, Deepest Canyons and A-List Animals'". Variety. Porter, Rick (May 10, 2024)
2025_in_American_television
Aberdeen. 29 December 1995. p. 6. "Grisly catalogue of unsolved murders spanning 25 years". The Free Library. 24 July 1999. Archived from the original on
List of unsolved murders in the United Kingdom (1990s)
List_of_unsolved_murders_in_the_United_Kingdom_(1990s)
Elizabeth (August 12, 2022). "Anne Heche, Star of Another World and Men in Trees, Dies at 53". People. Retrieved August 13, 2022. Tinoco, Armando (August
2022_in_American_television
South Korean actress (born 1990)
as a child actress in the television series Stairway to Heaven (2003) and Tree of Heaven (2006). In 2013, she starred in the film Miracle in Cell No. 7
Park_Shin-hye
Mountain range in Western Asia
The Zagros Mountains are a mountain range in West Asia spanning Iran, northern Iraq, and southeastern Turkey. The mountain range has a total length of
Zagros_Mountains
American multinational technology conglomerate
shift toward developing the metaverse—an interconnected digital ecosystem spanning virtual and augmented reality technologies. In 2023, Meta was ranked 31st
Meta_Platforms
Vector quantization algorithm minimizing the sum of squared deviations
parallelization strategies have been developed to distribute the workload across multi-core processors, GPUs, and distributed clusters. Shared Memory Model (OpenMP):
K-means_clustering
release of hacked emails, attempted alteration of vote tallies, and distributed denial-of-service attacks to delay the final result. They were found
Russian interference in the 2016 United States elections
Russian_interference_in_the_2016_United_States_elections
DISTRIBUTED MINIMUM-SPANNING-TREE
DISTRIBUTED MINIMUM-SPANNING-TREE
Boy/Male
Hindu
Distribute Love, Well wisher
Boy/Male
Tamil
Hetarth | ஹேதாரà¯à®¤Â
Distribute Love, Well wisher
Hetarth | ஹேதாரà¯à®¤Â
Boy/Male
Indian, Modern
Distribute the Knowledge
Boy/Male
Hindu
Distribute Love, Well wisher
Surname or Lastname
English
English : unexplained. Perhaps a variant of Channon.The earliest American Channing was John, who came from Dorset, England, in 1711 with his wife. Their son John became a prosperous merchant of Newport, RI, and their grandson William Ellery was born there in 1780. William Ellery Channing (1780–1842) was a Unitarian clergyman who founded the Massachusetts Peace Society, a precursor of the modern anti-war movement.
Surname or Lastname
English and Scottish
English and Scottish : habitational name from a place in Lincolnshire, so called from the Old English tribal name Spaldingas ‘people of the district called Spald’. The district name probably means ‘ditches’, referring to drainage channels in the fenland.The surname was taken to Scotland in the 13th century by Radulphus de Spalding. His descendants prospered, and the name is still common in Scotland. Early American Spaldings include Thomas Spalding, born in Frederica, GA, in 1774, who introduced sea-island cotton in GA, and the physician Lyman Spalding, born in Cornish, NH, in 1775, who founded U.S. Pharmacopoeia.
Boy/Male
Arabic, Muslim
One who Distributes
Boy/Male
Hindu, Indian
Distribute Love
Girl/Female
English, Hindu, Indian, Marathi
Small Daughter
Girl/Female
Arabic
Distributor
Boy/Male
Muslim
Distributor, Divider
Boy/Male
Muslim
Distributor, Divider
Surname or Lastname
English (chiefly Sussex)
English (chiefly Sussex) : variant of Standen, or a habitational name from a place in Lancashire with the same etymology.
Boy/Male
Tamil
Hitarth | ஹிதாரà¯à®¤Â
Distribute Love, Well wisher
Hitarth | ஹிதாரà¯à®¤Â
Surname or Lastname
English, Dutch, and North German
English, Dutch, and North German : from early Middle English penning, Low German penning, Middle Dutch penninc ‘penny’ (see Penny), a topographic name (from a field name) or a nickname referring to tax dues of a penny.South German : from the short form, Panno, of a Germanic personal name derived from a word meaning ‘ban’, ‘order’, ‘command’.
Surname or Lastname
English
English : patronymic from Mann 1 and 2.Irish : adopted as an English equivalent of Gaelic Ó MainnÃn ‘descendant of MainnÃn’, probably an assimilated form of MainchÃn, a diminutive of manach ‘monk’. This is the name of a chieftain family in Connacht. It is sometimes pronounced Ó MaingÃn and Anglicized as Mangan.Anstice Manning, widow of Richard Manning of Dartmouth, England, came to MA with her children in 1679. Her great-great-grandson Robert, born at Salem, MA, in 1784, was the uncle and protector of author Nathaniel Hawthorne. Another early bearer of the relatively common British name was Jeffrey Manning, one of the earliest settlers in Piscataway township, Middlesex Co., NJ. His great-grandson James Manning (1738–91) was a founder and the first president of Rhode Island College (Brown University).
Boy/Male
Muslim/Islamic
Divider distributor
Boy/Male
Indian
Distributor, Divider
Boy/Male
Indian
Distributor, Divider
Surname or Lastname
English
English : nickname from a diminutive of Middle English sparewe ‘sparrow’ (see Sparrow).Altered form of German Sperling.
DISTRIBUTED MINIMUM-SPANNING-TREE
DISTRIBUTED MINIMUM-SPANNING-TREE
Surname or Lastname
English and Dutch
English and Dutch : patronymic from Nichol.Jewish (American) : Americanized form of any of various like-sounding Jewish names.
Boy/Male
Indian, Sanskrit
Priest of the Gods
Girl/Female
Irish Hebrew
Bitter.
Girl/Female
Hindu
With great desire and wish, Truth of life
Girl/Female
Hindu, Indian
Ruby Jewel
Girl/Female
Arabic, Muslim, Sindhi
Bravery; Help; Courage; Succour
Girl/Female
Indian, Telugu
Sun; Lakshmi
Boy/Male
Hindu, Indian, Marathi, Tamil, Traditional
Hari's Son
Male
English
Pet form of English Ernest, ERNIE means "battle (to the death), serious business."
Girl/Female
Arabic, Danish, Finnish, German, Greek, Hindu, Indian, Kannada, Marathi, Muslim, Swedish
Moonlight
DISTRIBUTED MINIMUM-SPANNING-TREE
DISTRIBUTED MINIMUM-SPANNING-TREE
DISTRIBUTED MINIMUM-SPANNING-TREE
DISTRIBUTED MINIMUM-SPANNING-TREE
DISTRIBUTED MINIMUM-SPANNING-TREE
n.
The least quantity assignable, admissible, or possible, in a given case; hence, a thing of small consequence; -- opposed to maximum.
pl.
of Minimus
a.
Not flowing; stagnant; as, standing water.
n.
One who, or that which, distributes or deals out anything; a dispenser.
a.
Established by law, custom, or the like; settled; continually existing; permanent; not temporary; as, a standing army; legislative bodies have standing rules of proceeding and standing committees.
n.
In a curve referred to polar coordinates, any point for which the radius vector is a maximum or minimum.
n.
Minimum.
n.
A self-registering thermometer, especially one that registers the maximum and minimum during long periods.
a.
Greatest in quantity or highest in degree attainable or attained; as, a maximum consumption of fuel; maximum pressure; maximum heat.
v. t.
To dispense; to administer; as, to distribute justice.
n.
Maintenance of position; duration; duration or existence in the same place or condition; continuance; as, a custom of long standing; an officer of long standing.
a.
Tending to distribute or be distributed; that distributes; distributive.
n.
The greatest quantity or value attainable in a given case; or, the greatest value attained by a quantity which first increases and then begins to decrease; the highest point or degree; -- opposed to minimum.
pl.
of Minimum
n.
Condition in society; relative position; reputation; rank; as, a man of good standing, or of high standing.
a.
Not movable; fixed; as, a standing bed (distinguished from a trundle-bed).
n.
A minim.
imp. & p. p.
of Distribute
a.
Remaining erect; not cut down; as, standing corn.