Matches in DBpedia 2016-04 for { <http://books.google.com/books?vid=ISBN0-7167-1045-5> ?p ?o }
- books?vid=ISBN0-7167-1045-5 at "A1.1: GT7, p. 191".
- books?vid=ISBN0-7167-1045-5 at "A1.1: GT8, p. 192".
- books?vid=ISBN0-7167-1045-5 at "A2.2: ND16, pg.210".
- books?vid=ISBN0-7167-1045-5 at "GT4".
- books?vid=ISBN0-7167-1045-5 at "Problem OPEN12, p. 288".
- books?vid=ISBN0-7167-1045-5 at "Section 7.5: Logarithmic Space, pp. 177–181".
- books?vid=ISBN0-7167-1045-5 at "p. 228 A4.2: SR8".
- books?vid=ISBN0-7167-1045-5 author Michael_R._Garey.
- books?vid=ISBN0-7167-1045-5 author "M. Garey and D. Johnson".
- books?vid=ISBN0-7167-1045-5 author "M.R. Garey".
- books?vid=ISBN0-7167-1045-5 author "Michael R. Garey and David S. Johnson".
- books?vid=ISBN0-7167-1045-5 author1Link "Michael Garey".
- books?vid=ISBN0-7167-1045-5 author1Link "Michael R. Garey".
- books?vid=ISBN0-7167-1045-5 author2 David_S._Johnson.
- books?vid=ISBN0-7167-1045-5 author2 "D.S. Johnson".
- books?vid=ISBN0-7167-1045-5 author2 "David S. Johnson".
- books?vid=ISBN0-7167-1045-5 author2 "Johnson, D.S.".
- books?vid=ISBN0-7167-1045-5 author2Link "David S. Johnson".
- books?vid=ISBN0-7167-1045-5 authorlink "Michael Garey".
- books?vid=ISBN0-7167-1045-5 authorlink "Michael R. Garey".
- books?vid=ISBN0-7167-1045-5 authorlink1 "Michael Garey".
- books?vid=ISBN0-7167-1045-5 authorlink1 "Michael R. Garey".
- books?vid=ISBN0-7167-1045-5 authorlink2 "David S. Johnson".
- books?vid=ISBN0-7167-1045-5 contribution "3.2.3 Component Design".
- books?vid=ISBN0-7167-1045-5 contribution "A2.3: ND22–24".
- books?vid=ISBN0-7167-1045-5 contribution "Section 7.4: Polynomial Space Completeness".
- books?vid=ISBN0-7167-1045-5 contribution "[GT24] Balanced complete bipartite subgraph".
- books?vid=ISBN0-7167-1045-5 editor Victor_Klee.
- books?vid=ISBN0-7167-1045-5 first "M.R.".
- books?vid=ISBN0-7167-1045-5 first "Michael R.".
- books?vid=ISBN0-7167-1045-5 first1 "M. R.".
- books?vid=ISBN0-7167-1045-5 first1 "M.R.".
- books?vid=ISBN0-7167-1045-5 first1 "Michael R.".
- books?vid=ISBN0-7167-1045-5 first1 "Michael".
- books?vid=ISBN0-7167-1045-5 first2 "D. S.".
- books?vid=ISBN0-7167-1045-5 first2 "D.S.".
- books?vid=ISBN0-7167-1045-5 first2 "David S.".
- books?vid=ISBN0-7167-1045-5 first2 "David".
- books?vid=ISBN0-7167-1045-5 isCitedBy Bipartite_dimension.
- books?vid=ISBN0-7167-1045-5 isCitedBy Boolean_satisfiability_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Bottleneck_traveling_salesman_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Clique_cover_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Complete_bipartite_graph.
- books?vid=ISBN0-7167-1045-5 isCitedBy Complete_coloring.
- books?vid=ISBN0-7167-1045-5 isCitedBy Computers_and_Intractability.
- books?vid=ISBN0-7167-1045-5 isCitedBy Cook–Levin_theorem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Cut_(graph_theory).
- books?vid=ISBN0-7167-1045-5 isCitedBy Degree-constrained_spanning_tree.
- books?vid=ISBN0-7167-1045-5 isCitedBy Edge_cover.
- books?vid=ISBN0-7167-1045-5 isCitedBy Edge_dominating_set.
- books?vid=ISBN0-7167-1045-5 isCitedBy Exact_cover.
- books?vid=ISBN0-7167-1045-5 isCitedBy Feedback_arc_set.
- books?vid=ISBN0-7167-1045-5 isCitedBy Feedback_vertex_set.
- books?vid=ISBN0-7167-1045-5 isCitedBy Gadget_(computer_science).
- books?vid=ISBN0-7167-1045-5 isCitedBy Graph_bandwidth.
- books?vid=ISBN0-7167-1045-5 isCitedBy Graph_coloring.
- books?vid=ISBN0-7167-1045-5 isCitedBy Hamiltonian_path_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Knapsack_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy L_(complexity).
- books?vid=ISBN0-7167-1045-5 isCitedBy Linear_programming.
- books?vid=ISBN0-7167-1045-5 isCitedBy List_of_PSPACE-complete_problems.
- books?vid=ISBN0-7167-1045-5 isCitedBy List_of_important_publications_in_theoretical_computer_science.
- books?vid=ISBN0-7167-1045-5 isCitedBy List_of_multiple_discoveries.
- books?vid=ISBN0-7167-1045-5 isCitedBy Matching_(graph_theory).
- books?vid=ISBN0-7167-1045-5 isCitedBy Maximum_common_subgraph_isomorphism_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Maximum_cut.
- books?vid=ISBN0-7167-1045-5 isCitedBy Metric_dimension_(graph_theory).
- books?vid=ISBN0-7167-1045-5 isCitedBy Minimum-weight_triangulation.
- books?vid=ISBN0-7167-1045-5 isCitedBy Multipartite_graph.
- books?vid=ISBN0-7167-1045-5 isCitedBy NP-completeness.
- books?vid=ISBN0-7167-1045-5 isCitedBy NP-hardness.
- books?vid=ISBN0-7167-1045-5 isCitedBy PSPACE-complete.
- books?vid=ISBN0-7167-1045-5 isCitedBy P_versus_NP_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Partition_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Polynomial_hierarchy.
- books?vid=ISBN0-7167-1045-5 isCitedBy Post_correspondence_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Quadratic_assignment_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Quadratic_programming.
- books?vid=ISBN0-7167-1045-5 isCitedBy Quadratic_residue.
- books?vid=ISBN0-7167-1045-5 isCitedBy Rainbow_matching.
- books?vid=ISBN0-7167-1045-5 isCitedBy Set_packing.
- books?vid=ISBN0-7167-1045-5 isCitedBy Set_splitting_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Shortest_common_supersequence_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Shortest_total_path_length_spanning_tree.
- books?vid=ISBN0-7167-1045-5 isCitedBy Strong_NP-completeness.
- books?vid=ISBN0-7167-1045-5 isCitedBy Subgraph_isomorphism_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Subset_sum_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy Travelling_salesman_problem.
- books?vid=ISBN0-7167-1045-5 isCitedBy True_quantified_Boolean_formula.
- books?vid=ISBN0-7167-1045-5 isCitedBy Vertex_cover.
- books?vid=ISBN0-7167-1045-5 isbn "0-7167-1045-5".
- books?vid=ISBN0-7167-1045-5 last "Garey".
- books?vid=ISBN0-7167-1045-5 last1 "Garey".
- books?vid=ISBN0-7167-1045-5 last2 "Johnson".
- books?vid=ISBN0-7167-1045-5 location "New York".
- books?vid=ISBN0-7167-1045-5 location "San Francisco".
- books?vid=ISBN0-7167-1045-5 location "San Francisco, Calif.".
- books?vid=ISBN0-7167-1045-5 mr "519066".
- books?vid=ISBN0-7167-1045-5 page "196".
- books?vid=ISBN0-7167-1045-5 page "228".