Scholar IQ
Try ScholarIQ free
Upload Records Snowball Search Search OpenAlex
About the database
ScholarIQanswers from OpenAlex

Approximating minimum bounded degree spanning trees to within one of optimal

PaperCitations, authors & open-access status

Approximating minimum bounded degree spanning trees to within one of optimal is a paper indexed in ScholarIQ from OpenAlex. ScholarIQ records 158 citations, 2007 year and closed oa status.

158
Citations
2007
Year
closed
OA Status

Related on ScholarIQ

Mohit Singh
Author
Complexity and Algorithms in Graphs
Topic
Complexity and Algorithms in Graphs
Topic
Machine Learning and Algorithms
Topic
Advanced Graph Theory Research
Topic
470M+ articles · free account