Search results
Results from the WOW.Com Content Network
Brooks (or Brook, Brookes) was a British slave ship launched at Liverpool in 1781. She became infamous after prints of her were published in 1788. Between 1782 and 1804, she made 11 voyages from Liverpool in the triangular slave trade in enslaved people (for the Brooks, England, to Africa, to the Caribbean, and back to England).
Brookes (ship).From the British Library: "This diagram of the 'Brookes' slave ship, which transported enslaved Africans to the Caribbean, is probably the most widely copied and powerful image used by those who campaigned to end the trans-Atlantic slave trade.
A plan of the British slave ship Brookes, showing how 454 slaves were accommodated on board after the Slave Trade Act 1788. This same ship had reportedly carried as many as 609 slaves and was 267 tons burden, making 2.3 slaves per ton. [1] Published by the Society for Effecting the Abolition of the Slave Trade
In graph theory, Brooks' theorem states a relationship between the maximum degree of a graph and its chromatic number. According to the theorem, in a connected graph in which every vertex has at most Δ neighbors, the vertices can be colored with only Δ colors, except for two cases, complete graphs and cycle graphs of odd length, which require ...
Thomas Clarkson (28 March 1760 – 26 September 1846) was an English abolitionist, and a leading campaigner against the slave trade in the British Empire.He helped found the Society for Effecting the Abolition of the Slave Trade (also known as the Society for the Abolition of the Slave Trade) and helped achieve passage of the Slave Trade Act 1807, which ended British trade in slaves.
Brooks discusses several causes of scheduling failures. The most enduring is his discussion of Brooks's law: Adding manpower to a late software project makes it later. Man-month is a hypothetical unit of work representing the work done by one person in one month; Brooks's law says that the possibility of measuring useful work in man-months is a myth, and is hence the centerpiece of the book.
Upgrade to a faster, more secure version of a supported browser. It's free and it only takes a few moments:
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency. A regular directed graph must also satisfy the stronger condition that the indegree and outdegree of each internal vertex are equal to each other. [1]