Stagger
发表于 2025-3-28 16:37:45
http://reply.papertrans.cn/16/1531/153048/153048_41.png
拍翅
发表于 2025-3-28 19:10:44
0302-9743 -18, 1990. SIGAL (Special Interest Group on Algorithms) was organized within the Information Processing Society of Japan in 1988 to encourage research in the field of discrete algorithms, and held 6-8 research meetings each year. This symposium is the first international symposium organized by SIGAL
暂时别动
发表于 2025-3-29 01:42:12
http://reply.papertrans.cn/16/1531/153048/153048_43.png
cauda-equina
发表于 2025-3-29 03:40:23
Betriebswirtschaftliche Studienlied to i) the problem of determining approximate extrema of a set of real numbers, in the same model, and ii) the multiparty broadcast communication complexity of determining the extrema of a set of integers held by distinct processors.
Malaise
发表于 2025-3-29 07:40:45
Parallel algorithms for generating subsets and set partitions,mes the existence of . individual processors operating synchronously without need to communicate among themselves. Parallel ranking and unranking procedures for each case are also presented. Applications of the parallel subset generation algorithm to subset-sum, knapsack and base-enumeration problems are subsequently presented.
专横
发表于 2025-3-29 14:17:48
Finding extrema with unary predicates,lied to i) the problem of determining approximate extrema of a set of real numbers, in the same model, and ii) the multiparty broadcast communication complexity of determining the extrema of a set of integers held by distinct processors.
一个搅动不安
发表于 2025-3-29 17:14:37
Wirkungsbeziehungen im E-Procurement, previously studied as proper circular arc graphs. Thus we obtain new recognition algorithms for proper circular arc graphs. We also give a more detailed structural characterization of chordal graphs that are orientable as local tournaments, i.e., that are proper circular arc graphs.
万神殿
发表于 2025-3-29 23:02:43
http://reply.papertrans.cn/16/1531/153048/153048_48.png
Mercantile
发表于 2025-3-30 03:20:28
Local tournaments and proper circular arc graphs, previously studied as proper circular arc graphs. Thus we obtain new recognition algorithms for proper circular arc graphs. We also give a more detailed structural characterization of chordal graphs that are orientable as local tournaments, i.e., that are proper circular arc graphs.
蛛丝
发表于 2025-3-30 05:28:03
Conference proceedings 1990ymposium also included 5 invited lectures and 10 invited presentations. The subjects of the papers range widely in the field of discrete algorithms in theoretical computer science. Keywords for these subjects are: computational geometry, graph algorithms, complexity theory, parallel algorithms, distributed computing, and computational algebra.