Majority spanning trees, cotrees and their applications
From MaRDI portal
Publication:2232225
DOI10.1007/978-3-030-68211-8_1OpenAlexW3131670487MaRDI QIDQ2232225
F. J. M. Salzborn, Mohammad Kaykobad
Publication date: 4 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-68211-8_1
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A new algorithm for ranking players of a round-robin tournament
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
- General network design: a unified view of combined location and network design problems
- An improved MST algorithm for ranking players of a round-robin tournament
- Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
This page was built for publication: Majority spanning trees, cotrees and their applications
