Titlebook: ;

Arb853

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.

要求比…更好

Defiance

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.

使困惑

作繭自縛

多產(chǎn)魚

滑動

不可知論

vector

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

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