OpenAlex
PricingAboutJobs
Log inGet started
Work

Spanning trees and optimization problems

HTML

Year: 2004
Type: book-review
Source: Choice Reviews Online
DOI: 10.5860/choice.42-1619a
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: spanning trees, minimum spanning tree, shortest path tree, approximate algorithms, polynomial-time approximation scheme, Steiner tree problem, minimum Steiner tree, maximum leaf spanning tree, tree balancing, Dijkstra's algorithm, Bellman-Ford algorithm, Kruskal's algorithm, Prim's algorithm, Boruvka's algorithm, counting spanning trees, graph optimization

Open Access status: closed
OpenAlex ID: W647522939
Cites: 101
Cited by: 237
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms