Arb853
发表于 2025-3-23 12:18:59
Embeddings of treelike graphs into 2-dimensional meshes,In the following we present embeddings of complete binary trees, pyramids and X-trees into 2-dimensional meshes. The presented embeddings achieve . expansion with congestion 2 for trees and congestion 6 for X-trees, and constant expansion ≤3 with congestion 3 for pyramids. The dilations are shown to be near optimal.
要求比…更好
发表于 2025-3-23 16:35:51
http://reply.papertrans.cn/39/3881/388028/388028_12.png
Defiance
发表于 2025-3-23 21:34:11
Finding minimally weighted subgraphs,ubgraph in an edge-weighted graph . on . nodes. We present an .(..)-algorithm for the weak subgraph problem. If the maximal degree of . is bounded, the algorithm above can be modified to an .(..)-algorithm for the induced subgraph problem.
使困惑
发表于 2025-3-24 01:59:00
http://reply.papertrans.cn/39/3881/388028/388028_14.png
作茧自缚
发表于 2025-3-24 04:21:22
http://reply.papertrans.cn/39/3881/388028/388028_15.png
多产鱼
发表于 2025-3-24 07:57:19
http://reply.papertrans.cn/39/3881/388028/388028_16.png
滑动
发表于 2025-3-24 13:54:21
http://reply.papertrans.cn/39/3881/388028/388028_17.png
不可知论
发表于 2025-3-24 17:45:53
http://reply.papertrans.cn/39/3881/388028/388028_18.png
vector
发表于 2025-3-24 19:24:59
Vertex-disjoint trees and boundary single-layer routing, consists of a set of . interconnecting the terminals belonging to the same (multi-terminal) net. An algorithm, unifying and generalizing previous BSLR algorithms, to solve an arbitrary instance of BSLR, is presented. Problems involving slidable terminals (i.e., when terminals can slide within a cer
multiply
发表于 2025-3-25 01:14:14
Bounds on the quality of approximate solutions to the group Steiner problem, required vertices and Steiner vertices, GSP asks for a shortest connected subgraph, containing at least one vertex of each group. As the Steiner Problem is NP-hard, GSP is too, and we are interested in approximation algorithms. Efficient approximation algorithms have already been proposed, but noth