Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:
Academic
Publications
Introduction to Algorithms, Second Edition

Introduction to Algorithms, Second Edition,Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein

Edit
Introduction to Algorithms, Second Edition   (Citations: 12540)
BibTex | RIS | RefWorks Download
Published in 2001.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Proof: An optimization problem can be solved by a greedy algorithm, if two properties hold [8]: the greedy choice property, and the optimal sub-structure property...
    • ...Having proved that a greedy approach can compute the paths with the minimum ETOP cost, we design an algorithm based on Dijkstra’s single-source shortest path algorithm [8] for doing so. The algorithm takes as input: (a) a graph representing the the network, (b) the edge weights, represented by the i (the probability of no drop), (c) a bound on the number of retransmissions at the link layer, K, and (d) a source node...

    Gentian Jakllari, et al. Link Positions Matter: A Noncommutative Routing Metric for Wireless Me...

    • ...There exists an 2-approximate algorithm [12] for the vertex cover problem.,Similar to the proof of the approximate ratio bound of VC problem [12], we prove the approximate ratio bound of Algorithm 2.,We first compute the shortest path between each pair of vertices in a query q using the Floyd Algorithm [12]...

    Zhao Sun, et al. Efficient Subgraph Matching on Billion Node Graphs

    • ...For example, the classic algorithm of Dijkstra [11] would take days to run on a web graph containing tens of billions of nodes and trillions of edges.,We describe the implementations of five basic graph algorithms, viz., PageRank [28], SALSA [20, 25], SCC [36, 4], WCC [11], and ASP [13], on a prototypical member of each model and further compare these implementations in terms of performance, scalability, and ease of implementation.,Algorithm 4 has resemblance to the algorithm for computing WCC using disjoint-set operations [11].,The SHS implementation of WCC is based on disjoint-set operations [11]...

    Marc Najork, et al. Of hammers and nails: an empirical comparison of three paradigms for p...

    • ... (2009)...

    Eliyahu Safra, et al. Ad hoc matching of vectorial road networks

    • ...If (v xy ) is the table of 0s and 1s associated with a binary relation ρ (by putting v xy = 1 if and only if xy ∈ ρ), then (v ∗ ) is exactly the table associated with ρ ∗ ,t he transitiveclosureof ρ.So,theoperation (v xy ) � (v ∗ xy )canbeviewedasaquantitative analogue of the notion of transitive closure (see Cormen et al. 2001, Chap...
    • ...Floyd–Warshall algorithm (Cormen et al. 2001, §25.2)...

    Rosa Camps, et al. A continuous rating method for preferential voting: the complete case

Sort by:

Citations (12540)

Share this on