( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Transitive Reduction of a Directed Graph.

, , и . SIAM J. Comput., 1 (2): 131-137 (1972)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

M R Buchmeiser

Jonas M R Lindert

R M W Dixon

Ester M R Ruprecht

Fridolin M R Walther

 

Другие публикации лиц с тем же именем

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences), и . W. H. Freeman, First Edition издание, (1979)The Transitive Reduction of a Directed Graph., , и . SIAM J. Comput., 1 (2): 131-137 (1972)The Complexity of Checkers on an N * N Board - Preliminary Report, , , , и . FOCS, стр. 55-64. IEEE Computer Society, (1978)Scheduling File Transfers in a Distributed Network., , , и . PODC, стр. 254-266. ACM, (1983)Some Simplified NP-Complete Problems, , и . STOC, стр. 47-63. ACM, (1974)The Complexity of Collapsing Reachability Graphs., , , и . Automatic Verification Methods for Finite State Systems, том 407 из Lecture Notes in Computer Science, стр. 264-274. Springer, (1989)Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings., , , , , , и . SIAM J. Discret. Math., 13 (3): 384-402 (2000)The Complexity of Searching a Graph (Preliminary Version), , , , и . FOCS, стр. 376-385. IEEE Computer Society, (1981)Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling, и . STOC, стр. 241-248. ACM, (1991)Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study, , , , , , , и . STOC, стр. 230-240. ACM, (1991)