Titlebook: ;

强制性

stressors

A简洁的

Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems,h endpoints into two different sets divided by the number of nodes of the smaller set. We prove that a solution or a constant times optimal approximation to the optimization version of a multicommodity flow problem yields a logarithmic, to the number of nets, approximation of the minimum net expansi

textile

On complexity of a message-routing strategy for multicomputer systems,er of other processors (.). A message-routing paradigm for such a multidestination communication has been formulated as finding a subgraph called an . (ODPT). We prove that the problem of finding an ODPT is NP-hard both for the .-cube graph as well as for a graph whose maximum degree is at most thre

Commemorate

Diagnosis of t/s-diagnosable systems,d integer .. The .-diagnosis algorithm of [10], the .+1-diagnosis algorithm of [11] and the .-diagnosis algorithm of this paper complement the corresponding .-diagnosability algorithms of Sullivan [12]. It is shown in [17] that the basic approach of the .-diagnosis algorithm of this paper can be use

按等级

一加就喷出

Remarks on some concurrency measures,, concurrency measures proposed by Charron-Bost [1989] and Fidge [1989]) in concurrency theory with old and new results developped in computational order theory (interval orders, lattice of maximal antichains, minimax antichains). We hope that this approach will be fruitful in both domains, for exam

optic-nerve

https://doi.org/10.1007/978-3-322-93306-5 coloring and maximal independent set in trees and bounded degree graphs; 7-colorability, maximal independent set and maximal matching in planar graphs; maximum independent set, maximum matching and Hamiltonian path on rectangular grid graphs. Our techniques are based on the . problem: given . lists

Carcinogenesis

mercenary

Modernisierung der Kommunalpolitik .) with a color, taken from a given set ., such that never two adjacent vertices are colored with the same color. In one variant, the first player which is unable to move, loses the game. In another variant, player 1 wins the game if and only if the game ends with all vertices colored. We show that