×

Found 2,545 Documents (Results 1–100)

Piercing diametral disks induced by edges of maximum spanning trees. (English) Zbl 07770282

Lin, Chun-Cheng (ed.) et al., WALCOM: algorithms and computation. 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22–24, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13973, 71-77 (2023).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

ReLU neural networks of polynomial size for exact maximum flow computation. (English) Zbl 07763016

Del Pia, Alberto (ed.) et al., Integer programming and combinatorial optimization. 24th international conference, IPCO 2023, Madison, WI, USA, June 21–23, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13904, 187-202 (2023).
MSC:  90C10 90C27
PDF BibTeX XML Cite
Full Text: DOI arXiv

On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter. (English. Russian original) Zbl 07760877

Autom. Remote Control 84, No. 7, 772-787 (2023); translation from Avtom. Telemekh. 2023, No. 7, 146-166 (2023).
PDF BibTeX XML Cite
Full Text: DOI

Efficiently enumerating all spanning trees of a plane 3-tree (extended abstract). (English) Zbl 07745719

Mavronicolas, Marios (ed.), Algorithms and complexity. 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13898, 368-382 (2023).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves. (English) Zbl 07745718

Mavronicolas, Marios (ed.), Algorithms and complexity. 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13898, 353-367 (2023).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Shooting stars in simple drawings of \(K_{m,n}\). (English) Zbl 07727752

Angelini, Patrizio (ed.) et al., Graph drawing and network visualization. 30th international symposium, GD 2022, Tokyo, Japan, September 13–16, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13764, 49-57 (2023).
MSC:  68R10 68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Compatible spanning trees in simple drawings of \(K_n\). (English) Zbl 07727749

Angelini, Patrizio (ed.) et al., Graph drawing and network visualization. 30th international symposium, GD 2022, Tokyo, Japan, September 13–16, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13764, 16-24 (2023).
MSC:  68R10 68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Two-stage minimum cost spanning tree game under fuzzy optimistic coalition. (English) Zbl 07762497

Petrosyan, Leon A. (ed.) et al., Contributions to game theory and management. Volume XV. Collected papers presented at the 15th international conference on game theory and management, GTM 2021, Saint Petersburg, Russia, June 23–25, 2021. St. Petersburg: St. Petersburg State University. 81-95 (2022).
MSC:  91A43 91A86
PDF BibTeX XML Cite
Full Text: DOI

Obtaining approximately optimal and diverse solutions via dispersion. (English) Zbl 07719347

Castañeda, Armando (ed.) et al., Latin 2022: theoretical informatics. 15th Latin American symposium, Guanajuato, Mexico, November 7–11, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13568, 222-239 (2022).
MSC:  68Qxx 68Rxx 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance. (English) Zbl 07708539

Ni, Qiufen (ed.) et al., Algorithmic aspects in information and management. 16th international conference, AAIM 2022, Guangzhou, China, August 13–14, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13513, 351-362 (2022).
MSC:  90C35 68W40
PDF BibTeX XML Cite
Full Text: DOI

Cyclically orderable generalized Petersen graphs. (English) Zbl 07708535

Ni, Qiufen (ed.) et al., Algorithmic aspects in information and management. 16th international conference, AAIM 2022, Guangzhou, China, August 13–14, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13513, 303-315 (2022).
PDF BibTeX XML Cite
Full Text: DOI

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
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software