作者: Alopecia-Areata 時(shí)間: 2025-3-21 20:25
https://doi.org/10.1007/978-3-662-05133-7Rowan Hamilton, who described, in a letter to his friend Graves in 1856, a mathematical game on the dodecahedron (Figure 18.1a) in which one person sticks pins in any five consecutive vertices and the other is required to complete the path so formed to a spanning cycle (see Biggs et al. (1986) or Ha作者: Scleroderma 時(shí)間: 2025-3-22 01:26
https://doi.org/10.1007/978-3-642-12419-8r instance covering the vertex set by subgraphs (see, for example, the extension of Theorem 18.10 noted at the end of Section 18.3). And, naturally, the same ideas apply equally well to directed graphs. The language of hypergraphs provides a convenient general setting in which to discuss these and r作者: myocardium 時(shí)間: 2025-3-22 06:50
Complexity of Algorithms,neral character, applying to all members of some family of graphs or digraphs. By an . of a problem, we mean the problem as applied to one specific member of the family. For example, an instance of the Minimum-Weight Spanning Tree Problem is the problem of finding an optimal tree in a particular wei作者: 薄荷醇 時(shí)間: 2025-3-22 12:41 作者: 針葉 時(shí)間: 2025-3-22 14:00 作者: 針葉 時(shí)間: 2025-3-22 18:02
https://doi.org/10.1057/9780230307827neral character, applying to all members of some family of graphs or digraphs. By an . of a problem, we mean the problem as applied to one specific member of the family. For example, an instance of the Minimum-Weight Spanning Tree Problem is the problem of finding an optimal tree in a particular weighted connected graph.作者: Brochure 時(shí)間: 2025-3-22 22:58
https://doi.org/10.1007/978-3-642-12419-8r instance covering the vertex set by subgraphs (see, for example, the extension of Theorem 18.10 noted at the end of Section 18.3). And, naturally, the same ideas apply equally well to directed graphs. The language of hypergraphs provides a convenient general setting in which to discuss these and related notions.作者: Arthr- 時(shí)間: 2025-3-23 05:04
Complexity of Algorithms,neral character, applying to all members of some family of graphs or digraphs. By an . of a problem, we mean the problem as applied to one specific member of the family. For example, an instance of the Minimum-Weight Spanning Tree Problem is the problem of finding an optimal tree in a particular weighted connected graph.作者: 無節(jié)奏 時(shí)間: 2025-3-23 08:12 作者: antidepressant 時(shí)間: 2025-3-23 12:21
Recall that an . graph is one that contains no cycles. A connected acyclic graph is called a .. The trees on six vertices are shown in Figure 4.1. According to these definitions, each component of an acyclic graph is a tree. For this reason, acyclic graphs are usually called ..作者: dissolution 時(shí)間: 2025-3-23 16:05
https://doi.org/10.1007/978-981-13-2143-6In Chapter 3, we introduced the notion of a cut edge and discussed various properties of connected graphs without cut edges. Here, we consider the analogous notion for vertices. There are, in fact, two closely related notions, that of a cut vertex and that of a separating vertex.作者: 陰郁 時(shí)間: 2025-3-23 20:58 作者: Occlusion 時(shí)間: 2025-3-23 22:11
https://doi.org/10.1007/978-3-540-48630-5In Chapter 14 we studied vertex colourings of graphs. We now turn our attention to the analogous concept of edge colouring.作者: 苦惱 時(shí)間: 2025-3-24 04:45 作者: 決定性 時(shí)間: 2025-3-24 07:48
Nonseparable Graphs,In Chapter 3, we introduced the notion of a cut edge and discussed various properties of connected graphs without cut edges. Here, we consider the analogous notion for vertices. There are, in fact, two closely related notions, that of a cut vertex and that of a separating vertex.作者: gospel 時(shí)間: 2025-3-24 12:09 作者: neolith 時(shí)間: 2025-3-24 17:16 作者: 任命 時(shí)間: 2025-3-24 19:13
Hamilton Cycles,icks pins in any five consecutive vertices and the other is required to complete the path so formed to a spanning cycle (see Biggs et al. (1986) or Hamilton (1931)). Hamilton was prompted to consider such cycles in his early investigations into group theory, the three edges incident to a vertex corresponding to three generators of a group.作者: 注入 時(shí)間: 2025-3-25 02:55 作者: Hyaluronic-Acid 時(shí)間: 2025-3-25 07:08 作者: 植物群 時(shí)間: 2025-3-25 11:00
Disaster Resilience and Green Growth species of pre-messenger RNA which are synthesized in various tissues or in one tissue at various stages of development, but which are spliced to give slightly different collections of exons in each tissue or at each stage of development. We wish to contrast such .: in the latter, various collectio作者: 羊齒 時(shí)間: 2025-3-25 14:48 作者: ADORE 時(shí)間: 2025-3-25 18:25 作者: 健忘癥 時(shí)間: 2025-3-25 22:43 作者: Tracheotomy 時(shí)間: 2025-3-26 03:08
Per Nilsson,Andreas Eckert,Dave Pratteady begun.Reveals the high degree of globalization that cha.In light of recent global trends and crises, including the hasty withdrawal of Western troops from Afghanistan and the Russian war of aggression against Ukraine, this book sheds new light on global power shifts in multiple areas of interna作者: Forehead-Lift 時(shí)間: 2025-3-26 05:36
Stephen Billettionship be- tween them, the best known being the reports to the Club of Rome. This study of the problems of providing living accommodation for a rapid- ly growing world population, taking into account the limits that must be set to this growth, was started in 1973 at the Academy of Architecture and 作者: 運(yùn)動(dòng)性 時(shí)間: 2025-3-26 11:30 作者: DOSE 時(shí)間: 2025-3-26 14:57 作者: Mortar 時(shí)間: 2025-3-26 18:32 作者: 繁榮中國(guó) 時(shí)間: 2025-3-27 01:01 作者: PANEL 時(shí)間: 2025-3-27 04:11 作者: 喚起 時(shí)間: 2025-3-27 06:22
2195-271X ten by experts in the field.Includes supplementary material:.This edited monograph presents the collected interdisciplinary research results of the priority program “Information- and Communication Theory in Molecular Biology (InKoMBio, SPP 1395)”, funded by the German Research Foundation DFG, 2010 u作者: amplitude 時(shí)間: 2025-3-27 11:02 作者: Crepitus 時(shí)間: 2025-3-27 13:50 作者: jocular 時(shí)間: 2025-3-27 19:03 作者: elastic 時(shí)間: 2025-3-28 00:12 作者: 建筑師 時(shí)間: 2025-3-28 04:08
Fruit Fly Optimization-Based Reliable Routing Algorithm for Wireless Sensor Networks,ols node failure and link failure, thereby ensuring stable and reliable routing in WSN. The performance of the proposed RRA algorithm is validated with the predicted remaining delivery (PRD)-based routing algorithm and multi-objective fractional particle lion algorithm (MOFPL) in terms of packet del作者: Morsel 時(shí)間: 2025-3-28 07:57
Dynamo Processes in Stars,s needed.? Throughout the examples consideration is given to using colour. The examples produce simple results with the aim of providing building blocks for application oriented codes...The book is directed at graduate students and researchers who create computer code to visualise their data..978-3-319-74249-6978-3-319-74250-2作者: START 時(shí)間: 2025-3-28 13:52
,2 Ged?chtnis,serinnerungen herauf? Doch auf dem Weg zurück in die Vergangenheit werden die Erinnerungen rar, bis man für die ersten Jahre der Kindheit auf ein regelrechtes schwarzes Loch st??t. Dies ergab die erste einschl?gige Erhebung, durchgeführt von Victor und Catherine Henri (1896). In der Regel stammen di作者: custody 時(shí)間: 2025-3-28 17:38 作者: 大量殺死 時(shí)間: 2025-3-28 22:50
