engender 发表于 2025-3-23 13:18:36

Embedding one Interconnection Network in Another,ctures. Such embeddings can be viewed as high level descriptions of efficient methods to simulate an algorithm designed for one type of parallel machine on a different network structure and/or techniques to distribute data/program variables to achieve optimum use of all available processors...: 68Q10, 94’02, 94C15.

Duodenitis 发表于 2025-3-23 16:51:01

http://reply.papertrans.cn/24/2324/232342/232342_12.png

Conflagration 发表于 2025-3-23 19:00:17

Computational Graph Theory978-3-7091-9076-0Series ISSN 0344-8029

TRAWL 发表于 2025-3-24 01:53:47

http://reply.papertrans.cn/24/2324/232342/232342_14.png

troponins 发表于 2025-3-24 03:06:58

http://reply.papertrans.cn/24/2324/232342/232342_15.png

花争吵 发表于 2025-3-24 09:11:49

http://reply.papertrans.cn/24/2324/232342/232342_16.png

adroit 发表于 2025-3-24 11:40:45

https://doi.org/10.1007/978-3-319-12877-1.. Classical and recent results are surveyed in the development of efficient representations of dynamic partial orders by heaps and their generalizations...: 68B15, 06A10.

CLAN 发表于 2025-3-24 16:22:05

http://reply.papertrans.cn/24/2324/232342/232342_18.png

神圣不可 发表于 2025-3-24 20:04:37

http://reply.papertrans.cn/24/2324/232342/232342_19.png

sinoatrial-node 发表于 2025-3-25 00:21:21

Orders and Graphs,Orders and Graphs. This paper surveys the relationship between graphtheoretic and ordertheoretic questions. In the first part, we discuss recent results which answer ordertheoretic questions in a more general graphtheoretic framework. In the second part we address ordertheoretic approaches to graph-theoretic problems...: 05C20, 05C25, 06A10.
页: 1 [2] 3 4 5 6
查看完整版本: Titlebook: Computational Graph Theory; G. Tinhofer,E. Mayr,M. M. Syslo Book 1990 Springer-Verlag/Wien 1990 Layout.algorithms.calculus.computational g