Some Applications of the Depth-First Search Algorithm for Undirected Graphs [Articol]
| dc.contributor.author | Ciubotaru, Constantin | ro |
| dc.date.accessioned | 2025-07-02T12:24:47Z | |
| dc.date.issued | 2024 | |
| dc.description.abstract | Applications of the deep first search algorithm (DFS) have been developed that allow at a single traversal of the graph: a) to check the connectivity/biconnectivity of the graph, b) to build the spanning tree, c) to highlight the cut vertices, d) to calculate the biconnected components, e) to build the fundamental set of cycles.The proposed algorithms were programmed and tested. | en |
| dc.description.sponsorship | The project SIBIA 011301 has supported a part of the research for this paper. | en |
| dc.identifier.citation | CIUBOTARU, Constantin. Some Applications of the Depth-First Search Algorithm for Undirected Graphs. In: International Conference dedicated to the 60th anniversary of the foundation of Vladimir Andrunachievici Institute of Mathematics and Computer Science, MSU, October 10-13 2024. Chisinau: [S. n.], 2024, pp. 266-271. ISBN 978-9975-68-515-3. | en |
| dc.identifier.isbn | 978-9975-68-515-3 | |
| dc.identifier.uri | https://msuir.usm.md/handle/123456789/18256 | |
| dc.language.iso | en | |
| dc.subject | undirected graph | en |
| dc.subject | biconnected graph | en |
| dc.subject | spanningtree | en |
| dc.subject | DFS | en |
| dc.subject | cut vertices | en |
| dc.subject | fundamental cycles | en |
| dc.title | Some Applications of the Depth-First Search Algorithm for Undirected Graphs [Articol] | en |
| dc.type | Article |