×

Found 2,380 Documents (Results 1–100)

100
MathJax

The number of spanning clusters of the uniform spanning tree in three dimensions. (English) Zbl 07500586

Inahama, Yuzuru (ed.) et al., Stochastic analysis, random fields and integrable probability – Fukuoka 2019. Proceedings of the 12th Mathematical Society of Japan, Seasonal Institute (MSJ-SI), Kyushu University, Japan, 31 July – 9 August 2019. Tokyo: Mathematical Society of Japan. Adv. Stud. Pure Math. 87, 403-415 (2021).
MSC:  05C30 05C80 60D05
PDF BibTeX XML Cite
Full Text: DOI

The minimum moving spanning tree problem. (English) Zbl 07498665

Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 15-28 (2021).
MSC:  68P05 68Wxx
PDF BibTeX XML Cite
Full Text: DOI

The connected domination number of grids. (English) Zbl 07497535

Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 247-258 (2021).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights. (English) Zbl 07495072

Pardalos, Panos (ed.) et al., Mathematical optimization theory and operations research. 20th international conference, MOTOR 2021, Irkutsk, Russia, July 5–10, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12755, 67-78 (2021).
PDF BibTeX XML Cite
Full Text: DOI

On the structure property of PCR’s adjacency graph with a prime order and its application of constructing m-sequences. (English) Zbl 07441153

Wu, Yongdong (ed.) et al., Information security and cryptology. 16th international conference, Inscrypt 2020, Guangzhou, China, December 11–14, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12612, 307-317 (2021).
MSC:  94C15 94A55
PDF BibTeX XML Cite
Full Text: DOI

Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. (English) Zbl 07405967

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 260-271 (2021).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Majority spanning trees, cotrees and their applications. (English) Zbl 07405947

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 3-12 (2021).
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

Classification

Biographic Reference

all top 3

Software