{
"item_title" : "Graph Algorithms",
"item_author" : [" Jesper Jansson "],
"item_description" : "This is a Reprint of one of the first Special Issues of Algorithms ever published. It focuses on the theoretical and practical performance of algorithms for solving computational problems involving graphs. Several highly cited articles are included, which investigate topics such as the maximum clique problem, the Dubins traveling salesman problem, and computing the eccentricity distribution of a graph.",
"item_img_path" : "https://covers4.booksamillion.com/covers/bam/3/72/584/509/3725845093_b.jpg",
"price_data" : {
"retail_price" : "83.71", "online_price" : "83.71", "our_price" : "83.71", "club_price" : "83.71", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Graph Algorithms
Overview
This is a Reprint of one of the first Special Issues of Algorithms ever published. It focuses on the theoretical and practical performance of algorithms for solving computational problems involving graphs. Several highly cited articles are included, which investigate topics such as the maximum clique problem, the Dubins traveling salesman problem, and computing the eccentricity distribution of a graph.
Customers Also Bought
Details
- ISBN-13: 9783725845095
- ISBN-10: 3725845093
- Publisher: Mdpi AG
- Publish Date: July 2025
- Dimensions: 9.61 x 6.69 x 0.63 inches
- Shipping Weight: 1.31 pounds
- Page Count: 182
Related Categories
