Introduction to Algorithms, Second Edition
By T. Cormen, Charles E. Leiserson, R. Rivest, C. Stein. 2001
2,867 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/7bcc53f1baf3358517a602d856192faea9442c91
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Sonia Martínez
- Jorge Cortés
- David Pisinger
- Yue Jia
- Stefan Røpke
- Jean-Pierre Hubaux
- Bin Shao
- Marcel Keller
Citations in the corpus
- Preserving Privacy in Social Networks Against Neighborhood Attacks (2008, background): “The depth-first search tree (DFS-tree for short) [18] is popularly used for navigating connected graphs.”
- CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming (2005, background): “This problem is a variation of the Parallel machine scheduling, which is known NP-hard [25].”
- Higher Order Mutation Testing (2009, methodology): “A greedy algorithm (GR) is an algorithm that makes local optimised choices at each stage with the hope of achieving a near global optimum [52].”
- Watershed Cuts: Minimum Spanning Forests and the Drop of Water Principle (2009, background): “Many efficient algorithms (see a survey in [29]) exist in the literature for solving the minimum spanning tree problem.”
- An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows (2006, methodology): “Notice that the sorting in line 7 can be avoided in an actual implementation of the algorithm, as it is sufficient to use a linear time selection algorithm [6] in line 9.”
- Efficient Subgraph Matching on Billion Node Graphs (2012, methodology): “There exists an 2-approximate algorithm [12] for the vertex cover problem.”
- Path Planning for Autonomous Underwater Vehicles (2007, background): “For optimal efficiency the priority queue is stored in a heap structure [19].”
- A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems (2010, methodology): “The heuristic-based selection operator for the 0-1 KP is as follows [21].”
- Main-memory triangle computations for very large (sparse (power-law)) graphs (2008, methodology): “We use here the classical notions of covering trees and connected components, as defined for instance in [17].”