大包裹
发表于 2025-3-25 06:40:51
http://reply.papertrans.cn/23/2299/229876/229876_21.png
gerrymander
发表于 2025-3-25 10:39:52
http://reply.papertrans.cn/23/2299/229876/229876_22.png
Feedback
发表于 2025-3-25 13:15:57
http://reply.papertrans.cn/23/2299/229876/229876_23.png
确认
发表于 2025-3-25 16:00:47
Anlässe für Situationsklärungentite graph . contains a non-crossing spanning tree whose maximum degree is at most .; this is the best possible upper bound on the maximum degree. This solves an open problem posed by Abellanas . at the Graph Drawing Symposium, 1996.
PAN
发表于 2025-3-26 00:03:38
https://doi.org/10.1007/978-3-658-34328-6ansforms 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-26 03:45:41
http://reply.papertrans.cn/23/2299/229876/229876_26.png
铁砧
发表于 2025-3-26 04:58:01
http://reply.papertrans.cn/23/2299/229876/229876_27.png
使成整体
发表于 2025-3-26 10:20:24
https://doi.org/10.1007/978-3-319-44543-4approximation algorithms; data structures; dynamic programming; graph algorithms; social networks; algori
口味
发表于 2025-3-26 15:06:20
978-3-319-44542-7Springer International Publishing Switzerland 2016
宇宙你
发表于 2025-3-26 18:25:56
On the Complexity of Computing Treebreadthn are the maximum diameter and radius of its bags respectively. The . and the . of a graph are the minimum length and breadth of its tree-decompositions respectively. . and . are defined similarly for path-decompositions. In this paper, we answer open questions of [Dragan and Köhler, Algorithmica 20