laparoscopy
发表于 2025-3-28 18:08:19
Weighted de Bruijn Graphs for the Menage Problem and Its Generalizationsnd no . consecutive persons are of the same gender. While the case of . corresponds to the classical . with a well-studied solution, no closed-form expression for the number of seating arrangements is known when ...We propose a novel approach for this type of problems based on enumeration of walks i
油膏
发表于 2025-3-28 19:17:14
Reconfiguration of Steiner Trees in an Unweighted Graphansforms a given Steiner tree into another one by exchanging a single edge at a time. In this paper, we show that the problem is PSPACE-complete even for split graphs (and hence for chordal graphs), while solvable in linear time for interval graphs.
类人猿
发表于 2025-3-28 23:30:28
http://reply.papertrans.cn/23/2299/229876/229876_43.png
Ingest
发表于 2025-3-29 07:09:14
http://reply.papertrans.cn/23/2299/229876/229876_44.png
galley
发表于 2025-3-29 08:00:56
http://reply.papertrans.cn/23/2299/229876/229876_45.png
exigent
发表于 2025-3-29 11:29:21
http://reply.papertrans.cn/23/2299/229876/229876_46.png
exacerbate
发表于 2025-3-29 17:56:48
Weighted de Bruijn Graphs for the Menage Problem and Its Generalizationsn certain algebraically weighted de Bruijn graphs. Our approach leads to new expressions for the menage numbers and their exponential generating function and allows one to efficiently compute the number of seating arrangements in general cases, which we illustrate in detail for the ternary case of ..
蜈蚣
发表于 2025-3-29 21:07:58
Conference proceedings 2016t 2016. . The 35 papers presented in this volume were carefully reviewed and selected from 87 submissions. They were organized in topical sessions named: computational complexity; computational geometry; networks; enumeration; online algorithms; algorithmic graph theory; dynamic programming; combina
隐语
发表于 2025-3-30 02:31:37
http://reply.papertrans.cn/23/2299/229876/229876_49.png
白杨
发表于 2025-3-30 05:05:09
https://doi.org/10.1007/978-3-658-34328-6ng the first . algorithm for updating 2-hop cover labelings for distance queries. We also conduct an extensive experimental study on real and synthetic dynamic networks, to show the scalability and efficiency of our new methods.