標題: Titlebook: Relations and Graphs; Discrete Mathematics Gunther Schmidt,Thomas Str?hlein Book 1993 Springer-Verlag Berlin Heidelberg 1993 Programmierspr [打印本頁] 作者: misperceive 時間: 2025-3-21 17:54
書目名稱Relations and Graphs影響因子(影響力)
書目名稱Relations and Graphs影響因子(影響力)學科排名
書目名稱Relations and Graphs網(wǎng)絡(luò)公開度
書目名稱Relations and Graphs網(wǎng)絡(luò)公開度學科排名
書目名稱Relations and Graphs被引頻次
書目名稱Relations and Graphs被引頻次學科排名
書目名稱Relations and Graphs年度引用
書目名稱Relations and Graphs年度引用學科排名
書目名稱Relations and Graphs讀者反饋
書目名稱Relations and Graphs讀者反饋學科排名
作者: landfill 時間: 2025-3-21 21:43
https://doi.org/10.1007/978-3-642-77968-8Programmiersprache; algorithms; computer; computer science; concurrency; design; discrete mathematics; grap作者: Nebulizer 時間: 2025-3-22 04:02 作者: 1FAWN 時間: 2025-3-22 04:59 作者: TRAWL 時間: 2025-3-22 09:03 作者: 離開 時間: 2025-3-22 14:51 作者: 河潭 時間: 2025-3-22 20:34 作者: 使迷惑 時間: 2025-3-22 23:21 作者: 上釉彩 時間: 2025-3-23 03:13
Heterogeneous Relations,We now pass from homogeneous to heterogeneous relations. In terms of matrices this amounts to passing from square matrices to general rectangular ones. The general principles stay the same as before, but when multiplying, joining, or intersecting heterogeneous relations one has to make sure that these operations are defined.作者: 平項山 時間: 2025-3-23 08:30
The Category of Graphs,Given any mathematical structure, one is interested in homomorphisms, substructures, and congruences. There is a characteristic difference between algebraic and relational structures.作者: Influx 時間: 2025-3-23 11:24 作者: GOAT 時間: 2025-3-23 15:18 作者: Gesture 時間: 2025-3-23 19:31
Gunther Schmidt,Thomas Str?hlein of relevant criteria than was the total scale variance. These findings would suggest that users of the CPI might be better off to measure and interpret the two principal factors rather than attempt to derive meaning from a complex profile of scores.” (p.914)作者: Spirometry 時間: 2025-3-24 00:03
Gunther Schmidt,Thomas Str?hleinnations in four appendices. The first three chapters are a general introduction to the scientific method. Chapters 4 to 12 show different specific methods to deal with pharmacokinetic pr- lems. There is considerable overlap among those chapters; this is intentional and its p- pose is to convince the reader th978-1-4757-8739-9978-0-306-47924-3作者: larder 時間: 2025-3-24 03:09 作者: audiologist 時間: 2025-3-24 08:01
Gunther Schmidt,Thomas Str?hleinnations in four appendices. The first three chapters are a general introduction to the scientific method. Chapters 4 to 12 show different specific methods to deal with pharmacokinetic pr- lems. There is considerable overlap among those chapters; this is intentional and its p- pose is to convince the reader th978-1-4757-8739-9978-0-306-47924-3作者: arsenal 時間: 2025-3-24 11:05
nations in four appendices. The first three chapters are a general introduction to the scientific method. Chapters 4 to 12 show different specific methods to deal with pharmacokinetic pr- lems. There is considerable overlap among those chapters; this is intentional and its p- pose is to convince the reader th978-1-4757-8739-9978-0-306-47924-3作者: 向外供接觸 時間: 2025-3-24 16:52 作者: 路標 時間: 2025-3-24 21:24
Gunther Schmidt,Thomas Str?hleinsilon-variational principle, a deep and detailed study of separationproperties of two or more convex sets in general vector spaces, Helly’s theorem and its applications to optimization, etc.The bookis suitable 978-1-4614-2647-9978-0-387-68407-9Series ISSN 0072-5285 Series E-ISSN 2197-5612 作者: 拋媚眼 時間: 2025-3-25 00:56 作者: 共同時代 時間: 2025-3-25 06:27
Gunther Schmidt,Thomas Str?hleinsilon-variational principle, a deep and detailed study of separationproperties of two or more convex sets in general vector spaces, Helly’s theorem and its applications to optimization, etc.The bookis suitable 978-1-4614-2647-9978-0-387-68407-9Series ISSN 0072-5285 Series E-ISSN 2197-5612 作者: 釋放 時間: 2025-3-25 08:44 作者: 流動性 時間: 2025-3-25 14:00 作者: 行為 時間: 2025-3-25 15:48 作者: 揉雜 時間: 2025-3-25 22:09
Transitivity,fined, which is a closure operation like the ones we have encountered already in two earlier instances. We then discuss a well-known algorithm for constructing the transitive closure. Related algorithms, appropriately adapted, are widely used today as resolution procedures in logic programming.作者: musicologist 時間: 2025-3-26 01:39 作者: 條街道往前推 時間: 2025-3-26 07:01
Reachability,f the reachability relation. In Sect. 6.1 we define paths and distinguish between paths in 1-graphs and paths in directed graphs. In the first case one considers points in the second, points and arcs. We define reachability in terms of paths, and discuss rooted graphs and strong connectedness. In Se作者: 共同給與 時間: 2025-3-26 10:06 作者: 冷淡周邊 時間: 2025-3-26 14:31
Matchings and Coverings,torics. Section 9.1 deals with independence of points in a set of points of a graph, i.e., with their mutually being non-neighbors of each other, which can easily be characterized in terms of the adjacency Γ. We shall be interested in the biggest possible independent sets.作者: anthesis 時間: 2025-3-26 20:02
Programs: Correctness and Verification,t discussion we shall not take into account questions related to programming languages or the syntax of programs. When it becomes unavoidable in the sequel to deal with texts in progamming language, we shall use the following short expressions without specifying their syntax in a formal way:.Program作者: gregarious 時間: 2025-3-26 22:50 作者: 拱形大橋 時間: 2025-3-27 02:49 作者: chisel 時間: 2025-3-27 08:22
1431-2654 erse range ofproblem areas. Results are first motivated by practicalexamples, often visualized by both Boolean 0-1-matrices andgraphs, and then derived algebraically.978-3-642-77970-1978-3-642-77968-8Series ISSN 1431-2654 Series E-ISSN 2193-2069 作者: Simulate 時間: 2025-3-27 10:18 作者: flammable 時間: 2025-3-27 16:38
Book 1993heory, analysisof rewriting systems, and modern programminglanguagedesign. In addition, they appear in algorithms analysis andin the bulk of discrete mathematics taught to computerscientists.Thisbook is devoted to the background of these methods. Itexplains how to userelational and graph-theoretic m作者: 心胸開闊 時間: 2025-3-27 17:47 作者: 蚊子 時間: 2025-3-27 23:26
Homogeneous Relations,osition of relations which are treated in Sects. 2.2 and 2.3. There we make the transition from the algebra of sets to the algebra of relations. Section 2.4 contains a number of new concepts concerning subsets, points, and orderings which are taken up again in the appendix.作者: 蝕刻 時間: 2025-3-28 04:19
Kernels and Games,n the first part of Sect. 6.3; its lattice-theoretic nature will be clarified in Appendix A.3. In Sect. 8.3 the results on kernels will be applied to game theory, in particular to nim-type games and to chess endings.作者: 變白 時間: 2025-3-28 08:16 作者: backdrop 時間: 2025-3-28 11:18 作者: cochlea 時間: 2025-3-28 18:07 作者: 沙草紙 時間: 2025-3-28 19:35 作者: 一大塊 時間: 2025-3-29 02:38
Gunther Schmidt,Thomas Str?hleinming, etc.)in finite-dimensional spaces. The fundamental results of convexity theory and the theory of duality in nonlinear programmingand the theories of linear inequalities, convex polyhedra, andlinear programming are covered in detail.Over two hundred, carefully selected exercises should help the作者: 豐富 時間: 2025-3-29 05:36 作者: FUME 時間: 2025-3-29 09:25 作者: 聯(lián)想 時間: 2025-3-29 14:30
Gunther Schmidt,Thomas Str?hleinqual, the better we can hope to predict”. There are two points. (1) P correlates well with A and C, but also has a good deal of specific variance; perhaps this specific variance adds considerably to the predictive variance? (2) Other things are seldom equal; Reynolds and Nichols (1977) tested the qu
