×

Found 56 Documents (Results 1–56)

On conflict-free spanning tree: algorithms and complexity. (English) Zbl 07683165

Balachandran, Niranjan (ed.) et al., Algorithms and discrete applied mathematics. 8th international conference, CALDAM 2022, Puducherry, India, February 10–12, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13179, 91-102 (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Relation-algebraic verification of Borůvka’s minimum spanning tree algorithm. (English) Zbl 07670521

Fahrenberg, Uli (ed.) et al., Relational and algebraic methods in computer science. 19th international conference, RAMiCS 2021, Marseille, France, November 2–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13027, 225-240 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Listing subgraphs by Cartesian decomposition. (English) Zbl 1512.68207

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 84, 16 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Spanning-tree games. (English) Zbl 1512.68228

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 35, 16 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Multi-label learning through minimum spanning tree-based subset selection and feature extraction. (English) Zbl 1454.68130

Mouhoub, Malek (ed.) et al., Advances in artificial intelligence. 30th Canadian conference on artificial intelligence, Canadian AI 2017, Edmonton, AB, Canada, May 16–19, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10233, 90-96 (2017).
MSC:  68T05 62H30
PDFBibTeX XMLCite
Full Text: DOI

The weighted arborescence constraint. (English) Zbl 1489.68194

Salvagnin, Domenico (ed.) et al., Integration of AI and OR techniques in constraint programming. 14th international conference, CPAIOR 2017, Padua, Italy, June 5–8, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10335, 185-201 (2017).
MSC:  68R10 68T20
PDFBibTeX XMLCite
Full Text: DOI

The minimum spanning tree problem: Jarník’s solution in historical and present context. (English) Zbl 1291.05102

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 309-316 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field