《IWDMA'94 国际离散数学与算法研讨会文集》求取 ⇩

作者	苏运霖主编编者
出版	广州：暨南大学出版社
参考页数	257 ✅ 真实服务非骗流量 ❤️
出版时间	1994（求助前请核对）目录预览
ISBN号	7810293699 — 违规投诉 / 求助条款
PDF编号	8882008（学习资料勿作它用）
求助格式	扫描PDF（若分多册发行，每次仅能受理1册）

IWDMA'94 国际离散数学与算法研讨会文集 1994 PDF电子版封面 7810293699 苏运霖主编

PDF文件，前往提取

1 On Latin ArraysRenji Tao1

2 Cordial Labeling of mKnDavid Kuo＆Gerand J.Chang15

3 Partial Sorting Networks with ApplicationsShuo-Yen Rebert Li27

4 Functional Database Theory FDT and Lisp DatabaseJiepan Xu＆Tung Wang44

5 Exploring the Use of String Substitution in Modular ExponentiationLucas Chi Kwong Hui＆Kwok—Yan Lam60

6 Some Results on Subset Interconnection DesignsJaime D.L.Caro＆Polly W.Sy68

7 Software Development AutomationJian Ping Yin＆Huo Wang Chen76

8 Quasiphysical and Quasisocial Method for Tackling NP—hard Prob-lemsWenqi Huang89

9 The Structure of an Undirected Graph that is not K—Vertex—Con-nected and its Application on Smallest Four—Vertex—Connectivity AugmentationTsan—sheng Hsu92

10 Scheduling Distributed Tasks in Hard Real—Time Environment with a Movable ServerHua lin,Mi Lu＆Wei Zhao114

11 Theory of Program Computation over Rings and FieldsXiang Li126

12 A Discrete Optimization Approach for Redistribution ModelSydney C.K.Chu127

13 Data Security Equals Graph ConnectivityMing—Yang Kao134

14 Model and Designs for Path Layout in ATM NetworksO.Gerstel＆S.Zaks148

15 Difficulties in Approximation of Polygonal CurvesW.S.Chan＆F.Chin163

16 How Difficult is it to Obtain a Chromatic Polynomial?Qi Cheng＆Hong Zhu172

17 The Complexity of Approximation for k—KNAPSACKLi—ang Zhang177

18 Generaliged Exponents of Bookan MatricesBolian Liu181

19 Discrete Mathematics,Pansystems Phiosophical Logic and A.I.Youngli Li192

20 A Dimensional—pure Decomposition for Polynomial IdealsLian Li201

21 Programming via Proof—a case studyYiqiang Ding＆Yongsen Xu214