Baste, Julien; Watel, Dimitri An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. (English) Zbl 07807473 Theor. Comput. Sci. 990, Article ID 114406, 20 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Baste} and \textit{D. Watel}, Theor. Comput. Sci. 990, Article ID 114406, 20 p. (2024; Zbl 07807473) Full Text: DOI
Carrabs, Francesco; Cerulli, Raffaele; Laureana, Federica; Serra, Domenico; Sorgente, Carmine A genetic approach for the 2-edge-connected minimum branch vertices problem. (English) Zbl 07791136 Networks 82, No. 4, 301-317 (2023). MSC: 90Cxx PDFBibTeX XMLCite \textit{F. Carrabs} et al., Networks 82, No. 4, 301--317 (2023; Zbl 07791136) Full Text: DOI
Gargano, Luisa; Rescigno, Adele A. Spanning trees with few branch vertices in graphs of bounded neighborhood diversity. (English) Zbl 07786533 Rajsbaum, Sergio (ed.) et al., Structural information and communication complexity. 30th international colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6–9, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13892, 502-519 (2023). MSC: 68Mxx 68Q11 68R10 PDFBibTeX XMLCite \textit{L. Gargano} and \textit{A. A. Rescigno}, Lect. Notes Comput. Sci. 13892, 502--519 (2023; Zbl 07786533) Full Text: DOI
Fan, Dandan; Goryainov, Sergey; Huang, Xueyi; Lin, Huiqiu The spanning \(k\)-trees, perfect matchings and spectral radius of graphs. (English) Zbl 1512.05261 Linear Multilinear Algebra 70, No. 21, 7264-7275 (2022). MSC: 05C50 05C70 05C05 PDFBibTeX XMLCite \textit{D. Fan} et al., Linear Multilinear Algebra 70, No. 21, 7264--7275 (2022; Zbl 1512.05261) Full Text: DOI arXiv
Wu, Yueyu; Zhang, Yunqing; Chen, Yaojun Degree sums and spanning brooms of a graph. (English) Zbl 1491.05114 Discrete Math. 345, No. 9, Article ID 112966, 9 p. (2022). MSC: 05C38 05C07 05C05 05C35 PDFBibTeX XMLCite \textit{Y. Wu} et al., Discrete Math. 345, No. 9, Article ID 112966, 9 p. (2022; Zbl 1491.05114) Full Text: DOI
Carrabs, Francesco; Cerulli, Raffaele; D’Ambrosio, Ciriaco; Laureana, Federica The generalized minimum branch vertices problem: properties and polyhedral analysis. (English) Zbl 1469.90091 J. Optim. Theory Appl. 188, No. 2, 356-377 (2021). MSC: 90C10 90C35 90C57 PDFBibTeX XMLCite \textit{F. Carrabs} et al., J. Optim. Theory Appl. 188, No. 2, 356--377 (2021; Zbl 1469.90091) Full Text: DOI
Gould, Ronald J.; Shull, Warren On spanning trees with few branch vertices. (English) Zbl 1429.05040 Discrete Math. 343, No. 1, Article ID 111581, 7 p. (2020). MSC: 05C05 05C07 05C40 PDFBibTeX XMLCite \textit{R. J. Gould} and \textit{W. Shull}, Discrete Math. 343, No. 1, Article ID 111581, 7 p. (2020; Zbl 1429.05040) Full Text: DOI
DeBiasio, Louis; Lo, Allan Spanning trees with few branch vertices. (English) Zbl 1419.05044 SIAM J. Discrete Math. 33, No. 3, 1503-1520 (2019). MSC: 05C05 68M10 PDFBibTeX XMLCite \textit{L. DeBiasio} and \textit{A. Lo}, SIAM J. Discrete Math. 33, No. 3, 1503--1520 (2019; Zbl 1419.05044) Full Text: DOI arXiv
Singh, Kavita; Sundar, Shyam A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem. (English) Zbl 1430.90553 Eur. J. Oper. Res. 276, No. 1, 88-105 (2019). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{K. Singh} and \textit{S. Sundar}, Eur. J. Oper. Res. 276, No. 1, 88--105 (2019; Zbl 1430.90553) Full Text: DOI
Chen, Mingzhu; Zhou, Bo On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices. (English) Zbl 1411.05154 Appl. Math. Comput. 305, 166-173 (2017). MSC: 05C50 PDFBibTeX XMLCite \textit{M. Chen} and \textit{B. Zhou}, Appl. Math. Comput. 305, 166--173 (2017; Zbl 1411.05154) Full Text: DOI
Silvestri, Selene; Laporte, Gilbert; Cerulli, Raffaele A branch-and-cut algorithm for the minimum branch vertices spanning tree problem. (English) Zbl 1391.90619 Comput. Oper. Res. 81, 322-332 (2017). MSC: 90C35 90C27 90C57 90C59 PDFBibTeX XMLCite \textit{S. Silvestri} et al., Comput. Oper. Res. 81, 322--332 (2017; Zbl 1391.90619) Full Text: DOI
Landete, Mercedes; Marín, Alfredo; Sainz-Pardo, José Luis Decomposition methods based on articulation vertices for degree-dependent spanning tree problems. (English) Zbl 1394.90547 Comput. Optim. Appl. 68, No. 3, 749-773 (2017). MSC: 90C35 90C10 PDFBibTeX XMLCite \textit{M. Landete} et al., Comput. Optim. Appl. 68, No. 3, 749--773 (2017; Zbl 1394.90547) Full Text: DOI
Melo, Rafael A.; Samer, Phillippe; Urrutia, Sebastián An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. (English) Zbl 1357.90123 Comput. Optim. Appl. 65, No. 3, 821-844 (2016). MSC: 90C27 90C59 90C57 PDFBibTeX XMLCite \textit{R. A. Melo} et al., Comput. Optim. Appl. 65, No. 3, 821--844 (2016; Zbl 1357.90123) Full Text: DOI arXiv
Watel, Dimitri; Weisser, Marc-Antoine; Bentz, Cédric; Barth, Dominique Directed Steiner trees with diffusion costs. (English) Zbl 1356.90152 J. Comb. Optim. 32, No. 4, 1089-1106 (2016). MSC: 90C35 90C27 90C59 PDFBibTeX XMLCite \textit{D. Watel} et al., J. Comb. Optim. 32, No. 4, 1089--1106 (2016; Zbl 1356.90152) Full Text: DOI
Yan, Zheng Spanning trees whose stems have a bounded number of branch vertices. (English) Zbl 1339.05212 Discuss. Math., Graph Theory 36, No. 3, 773-778 (2016). MSC: 05C40 05C07 05C05 PDFBibTeX XMLCite \textit{Z. Yan}, Discuss. Math., Graph Theory 36, No. 3, 773--778 (2016; Zbl 1339.05212) Full Text: DOI
Marín, Alfredo Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem. (English) Zbl 1346.90789 Eur. J. Oper. Res. 245, No. 3, 680-689 (2015). MSC: 90C35 90C10 90C59 90C60 PDFBibTeX XMLCite \textit{A. Marín}, Eur. J. Oper. Res. 245, No. 3, 680--689 (2015; Zbl 1346.90789) Full Text: DOI
Chimani, Markus; Spoerhase, Joachim Approximating spanning trees with few branches. (English) Zbl 1328.68297 Theory Comput. Syst. 56, No. 1, 181-196 (2015). MSC: 68W25 68Q17 68T20 68R10 68W40 PDFBibTeX XMLCite \textit{M. Chimani} and \textit{J. Spoerhase}, Theory Comput. Syst. 56, No. 1, 181--196 (2015; Zbl 1328.68297) Full Text: DOI
Rossi, André; Singh, Alok; Sundar, Shyam Cutting-plane-based algorithms for two branch vertices related spanning tree problems. (English) Zbl 1364.90335 Optim. Eng. 15, No. 4, 855-887 (2014). MSC: 90C35 90B18 90C59 PDFBibTeX XMLCite \textit{A. Rossi} et al., Optim. Eng. 15, No. 4, 855--887 (2014; Zbl 1364.90335) Full Text: DOI
Cerrone, C.; Cerulli, R.; Raiconi, A. Relations, models and a memetic approach for three degree-dependent spanning tree problems. (English) Zbl 1305.90346 Eur. J. Oper. Res. 232, No. 3, 442-453 (2014). MSC: 90C27 90C35 05C85 90B18 PDFBibTeX XMLCite \textit{C. Cerrone} et al., Eur. J. Oper. Res. 232, No. 3, 442--453 (2014; Zbl 1305.90346) Full Text: DOI
Chen, Guantao; Ferrara, Michael; Hu, Zhiquan; Jacobson, Michael; Liu, Huiqing Degree conditions for spanning brooms. (English) Zbl 1303.05027 J. Graph Theory 77, No. 3, 237-250 (2014). MSC: 05C05 05C35 PDFBibTeX XMLCite \textit{G. Chen} et al., J. Graph Theory 77, No. 3, 237--250 (2014; Zbl 1303.05027) Full Text: DOI
Matsuda, Haruhide; Ozeki, Kenta; Yamashita, Tomoki Spanning trees with a bounded number of branch vertices in a claw-free graph. (English) Zbl 1298.05074 Graphs Comb. 30, No. 2, 429-437 (2014). MSC: 05C05 05C07 05C40 PDFBibTeX XMLCite \textit{H. Matsuda} et al., Graphs Comb. 30, No. 2, 429--437 (2014; Zbl 1298.05074) Full Text: DOI
Silva, Ricardo M. A.; Silva, Diego M.; Resende, Mauricio G. C.; Mateus, Geraldo R.; Gonçalves, José F.; Festa, Paola An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. (English) Zbl 1292.90305 Optim. Lett. 8, No. 4, 1225-1243 (2014). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{R. M. A. Silva} et al., Optim. Lett. 8, No. 4, 1225--1243 (2014; Zbl 1292.90305) Full Text: DOI Link
Watel, Dimitri; Weisser, Marc-Antoine; Bentz, Cédric; Barth, Dominique Steiner problems with limited number of branching nodes. (English) Zbl 1406.68092 Moscibroda, Thomas (ed.) et al., Structural information and communication complexity. 20th international colloquium, SIROCCO 2013, Ischia, Italy, July 1–3, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03577-2/pbk). Lecture Notes in Computer Science 8179, 310-321 (2013). MSC: 68R10 05C22 05C85 68Q25 PDFBibTeX XMLCite \textit{D. Watel} et al., Lect. Notes Comput. Sci. 8179, 310--321 (2013; Zbl 1406.68092) Full Text: DOI
Carrabs, Francesco; Cerulli, Raffaele; Gaudioso, Manlio; Gentili, Monica Lower and upper bounds for the spanning tree with minimum branch vertices. (English) Zbl 1312.90038 Comput. Optim. Appl. 56, No. 2, 405-438 (2013). MSC: 90C10 90C35 90C56 05C05 PDFBibTeX XMLCite \textit{F. Carrabs} et al., Comput. Optim. Appl. 56, No. 2, 405--438 (2013; Zbl 1312.90038) Full Text: DOI
Ozeki, Kenta; Yamashita, Tomoki Spanning trees: A survey. (English) Zbl 1232.05055 Graphs Comb. 27, No. 1, 1-26 (2011). Reviewer: Mikhail Ostrovskii (Queens) MSC: 05C05 05-02 05C12 05C45 PDFBibTeX XMLCite \textit{K. Ozeki} and \textit{T. Yamashita}, Graphs Comb. 27, No. 1, 1--26 (2011; Zbl 1232.05055) Full Text: DOI
Cerulli, R.; Gentili, M.; Iossa, A. Bounded-degree spanning tree problems: models and new algorithms. (English) Zbl 1211.90259 Comput. Optim. Appl. 42, No. 3, 353-370 (2009). MSC: 90C35 90C59 PDFBibTeX XMLCite \textit{R. Cerulli} et al., Comput. Optim. Appl. 42, No. 3, 353--370 (2009; Zbl 1211.90259) Full Text: DOI
Salamon, Gábor Approximating the maximum internal spanning tree problem. (English) Zbl 1194.68177 Theor. Comput. Sci. 410, No. 50, 5273-5284 (2009). MSC: 68R10 68W25 PDFBibTeX XMLCite \textit{G. Salamon}, Theor. Comput. Sci. 410, No. 50, 5273--5284 (2009; Zbl 1194.68177) Full Text: DOI
Gargano, Luisa; Hammar, Mikael; Hell, Pavol; Stacho, Ladislav; Vaccaro, Ugo Spanning spiders and light-splitting switches. (English) Zbl 1044.05048 Discrete Math. 285, No. 1-3, 83-95 (2004). MSC: 05C45 05C90 05C05 PDFBibTeX XMLCite \textit{L. Gargano} et al., Discrete Math. 285, No. 1--3, 83--95 (2004; Zbl 1044.05048) Full Text: DOI