On Tree Graphs and Graph Forests

Raymond Bisdorff

Chapter Chapter 22 in Algorithmic Decision Making with Python Resources, 2022, pp 319-328 from Springer

Abstract: Abstract The chapter specifically addresses working with tree graphs and graph forests. We illustrate how to generate and recognise random tree graphs and how to compute the centres of a tree and draw a rooted and oriented tree. Finally, algorithms for computing spanning trees and forests are presented.

Date: 2022
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-030-90928-4_22

Ordering information: This item can be ordered from
http://www.springer.com/9783030909284

DOI: 10.1007/978-3-030-90928-4_22

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().