SPANNING AND BASIS TREES IN THE MATROID MODEL
DOI:
https://doi.org/10.30890/2709-1783.2025-40-00-004Keywords:
Graphic matroid, Spanning tree, Kruskal’s algorithm, Delta-matroid constraints, Combinatorial optimization, GREEDI algorithmAbstract
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
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
Section
Abstracts
License
Copyright (c) 2025 Authors
This work is licensed under a Creative Commons Attribution 4.0 International License.
