Matches in DBpedia 2016-04 for { <http://books.google.com/books?vid=ISBN0-262-03293-7> ?p ?o }
- books?vid=ISBN0-262-03293-7 isCitedBy Cut_(graph_theory).
- books?vid=ISBN0-262-03293-7 isCitedBy Dijkstras_algorithm.
- books?vid=ISBN0-262-03293-7 isCitedBy Discrete_Fourier_transform.
- books?vid=ISBN0-262-03293-7 isCitedBy Disjoint-set_data_structure.
- books?vid=ISBN0-262-03293-7 isCitedBy Disjoint_sets.
- books?vid=ISBN0-262-03293-7 isCitedBy Dynamic_programming.
- books?vid=ISBN0-262-03293-7 isCitedBy Exponentiation.
- books?vid=ISBN0-262-03293-7 isCitedBy Fast_Fourier_transform.
- books?vid=ISBN0-262-03293-7 isCitedBy Fermat_primality_test.
- books?vid=ISBN0-262-03293-7 isCitedBy Flow_network.
- books?vid=ISBN0-262-03293-7 isCitedBy Ford–Fulkerson_algorithm.
- books?vid=ISBN0-262-03293-7 isCitedBy Fractal_tree_index.
- books?vid=ISBN0-262-03293-7 isCitedBy Graph_(abstract_data_type).
- books?vid=ISBN0-262-03293-7 isCitedBy Indicator_function.
- books?vid=ISBN0-262-03293-7 isCitedBy Integer_sorting.
- books?vid=ISBN0-262-03293-7 isCitedBy Josephus_problem.
- books?vid=ISBN0-262-03293-7 isCitedBy Ken_Batcher.
- books?vid=ISBN0-262-03293-7 isCitedBy Knuth–Morris–Pratt_algorithm.
- books?vid=ISBN0-262-03293-7 isCitedBy Linear_extension.
- books?vid=ISBN0-262-03293-7 isCitedBy Linked_list.
- books?vid=ISBN0-262-03293-7 isCitedBy Matrix_chain_multiplication.
- books?vid=ISBN0-262-03293-7 isCitedBy Maximum_flow_problem.
- books?vid=ISBN0-262-03293-7 isCitedBy Multi-commodity_flow_problem.
- books?vid=ISBN0-262-03293-7 isCitedBy NP-completeness.
- books?vid=ISBN0-262-03293-7 isCitedBy P_versus_NP_problem.
- books?vid=ISBN0-262-03293-7 isCitedBy Prefix_sum.
- books?vid=ISBN0-262-03293-7 isCitedBy Primality_test.
- books?vid=ISBN0-262-03293-7 isCitedBy RSA_(cryptosystem).
- books?vid=ISBN0-262-03293-7 isCitedBy Reachability.
- books?vid=ISBN0-262-03293-7 isCitedBy Recursion.
- books?vid=ISBN0-262-03293-7 isCitedBy Red–black_tree.
- books?vid=ISBN0-262-03293-7 isCitedBy SUHA_(computer_science).
- books?vid=ISBN0-262-03293-7 isCitedBy Set_cover_problem.
- books?vid=ISBN0-262-03293-7 isCitedBy Sublinear_function.
- books?vid=ISBN0-262-03293-7 isCitedBy Topological_sorting.
- books?vid=ISBN0-262-03293-7 isCitedBy Travelling_salesman_problem.
- books?vid=ISBN0-262-03293-7 isCitedBy Uniform_matroid.
- books?vid=ISBN0-262-03293-7 isCitedBy Vertex_cover.
- books?vid=ISBN0-262-03293-7 isbn "0-262-03293-7".
- books?vid=ISBN0-262-03293-7 last "Cormen".
- books?vid=ISBN0-262-03293-7 last1 "Cormen".
- books?vid=ISBN0-262-03293-7 last2 "Leiserson".
- books?vid=ISBN0-262-03293-7 last2 "Lesiserson".
- books?vid=ISBN0-262-03293-7 last3 "Rivest".
- books?vid=ISBN0-262-03293-7 last4 "Stein".
- books?vid=ISBN0-262-03293-7 lastauthoramp "yes".
- books?vid=ISBN0-262-03293-7 location "Cambridge".
- books?vid=ISBN0-262-03293-7 location "Cambridge, MA".
- books?vid=ISBN0-262-03293-7 location "Cambridge, Mass.".
- books?vid=ISBN0-262-03293-7 nameListFormat "vanc".
- books?vid=ISBN0-262-03293-7 nopp "true".
- books?vid=ISBN0-262-03293-7 origyear "1990".
- books?vid=ISBN0-262-03293-7 others "Chapter 1: Foundations".
- books?vid=ISBN0-262-03293-7 page "318".
- books?vid=ISBN0-262-03293-7 page "563,655,1043".
- books?vid=ISBN0-262-03293-7 page "889–890".
- books?vid=ISBN0-262-03293-7 pages "1024–1027".
- books?vid=ISBN0-262-03293-7 pages "1027–1033".
- books?vid=ISBN0-262-03293-7 pages "1033–1038".
- books?vid=ISBN0-262-03293-7 pages "168–170".
- books?vid=ISBN0-262-03293-7 pages "183–196".
- books?vid=ISBN0-262-03293-7 pages "204–209".
- books?vid=ISBN0-262-03293-7 pages "205–213,501–505".
- books?vid=ISBN0-262-03293-7 pages "221–252".
- books?vid=ISBN0-262-03293-7 pages "226–228".
- books?vid=ISBN0-262-03293-7 pages "253–272, 356–363".
- books?vid=ISBN0-262-03293-7 pages "273–301".
- books?vid=ISBN0-262-03293-7 pages "331–338".
- books?vid=ISBN0-262-03293-7 pages "34, 53–54".
- books?vid=ISBN0-262-03293-7 pages "364–7".
- books?vid=ISBN0-262-03293-7 pages "3–122".
- books?vid=ISBN0-262-03293-7 pages "434–454".
- books?vid=ISBN0-262-03293-7 pages "47–48".
- books?vid=ISBN0-262-03293-7 pages "498–524".
- books?vid=ISBN0-262-03293-7 pages "498–524".
- books?vid=ISBN0-262-03293-7 pages "527–529 of section 22.1: Representations of graphs".
- books?vid=ISBN0-262-03293-7 pages "527–531".
- books?vid=ISBN0-262-03293-7 pages "549–552".
- books?vid=ISBN0-262-03293-7 pages "595–601".
- books?vid=ISBN0-262-03293-7 pages "632–634".
- books?vid=ISBN0-262-03293-7 pages "643–668".
- books?vid=ISBN0-262-03293-7 pages "651–664".
- books?vid=ISBN0-262-03293-7 pages "696–697".
- books?vid=ISBN0-262-03293-7 pages "788–789".
- books?vid=ISBN0-262-03293-7 pages "822–848".
- books?vid=ISBN0-262-03293-7 pages "881–887".
- books?vid=ISBN0-262-03293-7 pages "887–896".
- books?vid=ISBN0-262-03293-7 pages "923–931".
- books?vid=ISBN0-262-03293-7 pages "94–99".
- books?vid=ISBN0-262-03293-7 pages "Chapter 34: NP–Completeness, pp. 966–1021".
- books?vid=ISBN0-262-03293-7 publisher MIT_Press.
- books?vid=ISBN0-262-03293-7 publisher "MIT Press & McGraw-Hill".
- books?vid=ISBN0-262-03293-7 publisher "MIT Press & McGraw–Hill".
- books?vid=ISBN0-262-03293-7 publisher "MIT Press and McGraw–Hill".
- books?vid=ISBN0-262-03293-7 publisher "MIT Press and McGraw-Hill".
- books?vid=ISBN0-262-03293-7 publisher "MIT Press and McGraw–Hill".
- books?vid=ISBN0-262-03293-7 publisher "MIT Press".
- books?vid=ISBN0-262-03293-7 publisher "MIT Press; McGraw-Hill".
- books?vid=ISBN0-262-03293-7 publisher "Mit Pr".
- books?vid=ISBN0-262-03293-7 ref "harv".