SPANNING AND BASIS TREES IN THE MATROID MODEL

Authors

DOI:

https://doi.org/10.30890/2709-1783.2025-40-00-004

Keywords:

Graphic matroid, Spanning tree, Kruskal’s algorithm, Delta-matroid constraints, Combinatorial optimization, GREEDI algorithm

Abstract

The subject of this research is the graphic matroid as a formal mathematical structure for modeling the process of constructing spanning trees in undirected graphs.The aim of the work is to develop and analyze a graphic matroid model that formalizes the

References

Matoya, K., & Oki, T. (2020). Pfaffian pairs and parities: Counting on linear matroid intersection and parity problems. https://arxiv.org/abs/1912.00620

Oxley, J.G. (2006) Matroid Theory. Oxford: Oxford University Press. Available at: Oxford Academic. https://academic.oup.com/book/34846

Wahlström, M. (2024). Representative set statements for delta-matroids and the Mader pp. 780–810. SIAM. Advance online publication. Available at: https://doi.org/10.1137/1.9781611977912

Downloads

Published

2025-08-30

How to Cite

Kulakovska, I. (2025). SPANNING AND BASIS TREES IN THE MATROID MODEL. SWorld-Ger Conference Proceedings, 1(gec40-00), 38–42. https://doi.org/10.30890/2709-1783.2025-40-00-004

Issue

No. gec40-00 (2025): Future in the results of modern scientific research '2025

Section

Abstracts

License

Copyright (c) 2025 Authors

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.