書目名稱Graphs, Networks and Algorithms影響因子(影響力)學(xué)科排名
書目名稱Graphs, Networks and Algorithms網(wǎng)絡(luò)公開度
書目名稱Graphs, Networks and Algorithms網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graphs, Networks and Algorithms被引頻次
書目名稱Graphs, Networks and Algorithms被引頻次學(xué)科排名
書目名稱Graphs, Networks and Algorithms年度引用
書目名稱Graphs, Networks and Algorithms年度引用學(xué)科排名
書目名稱Graphs, Networks and Algorithms讀者反饋
書目名稱Graphs, Networks and Algorithms讀者反饋學(xué)科排名
作者: 終止 時(shí)間: 2025-3-21 22:50 作者: 勤勉 時(shí)間: 2025-3-22 03:17
https://doi.org/10.1057/9780230509726methods used in a very large area of mathematics; we can only achieve this (without exceeding the limits of this book) by omitting the details of programming techniques. Readers interested in concrete programs are referred to Syslo, Deo and Kowalik (1983) and Nijenhuis and Wilf (1978), where program作者: compose 時(shí)間: 2025-3-22 04:41 作者: 天文臺(tái) 時(shí)間: 2025-3-22 10:41
https://doi.org/10.1057/9780230509726 is easy to verify for any given graph. But how can we find an Euler tour in an Eulerian graph? The proof of Theorem 1.3.1 only shows that such a tour exists, but does not tell us how to find it (though it contains a hint of how to achieve this). We are looking for a method for constructing an Euler作者: 課程 時(shí)間: 2025-3-22 13:15
Zhaoyuan Tian,Shuxian Ye,Hang Qiangerman motorways in the official guide ‘Autobahn Service’, the railroad or bus lines in some system of public transportation, or the network of routes an airline offers are represented as graphs without anybody being aware of it. Thus, it is obviously of great practical interest to study paths in su作者: 課程 時(shí)間: 2025-3-22 17:28
https://doi.org/10.1007/978-1-4039-1402-6etermining the number of trees on . vertices and, more generally, the number of spanning trees in a connected graph. The main part of this chapter is devoted to problems of the following kind: In some given network, we look for a spanning tree for which the sum of all lengths of edges is minimal. Th作者: 一大塊 時(shí)間: 2025-3-23 00:33
https://doi.org/10.1007/978-3-8350-9108-5on ‘independence systems’ (as, for example, in the case of the Algorithm of Kruskal, the system of spanning forests of a graph). However, the strategy used is rather short-sighted: we always choose the element which seems best at the moment (that is, of all the admissible elements, we choose the ele作者: 悶熱 時(shí)間: 2025-3-23 03:08 作者: AVANT 時(shí)間: 2025-3-23 06:27
https://doi.org/10.1057/9781137010452rsal Theory can be developed from the theory of flows on networks; this approach was first suggested in the book by Ford and Fulkerson (1962) and is also used in the survey by Jungnickel (1986). Compared with the usual approach of taking the Marriage Theorem of Hall (1935) — which we treat in Sectio作者: seduce 時(shí)間: 2025-3-23 13:30
Myxozoan Evolution, Ecology and Development orderings (as studied in Section 7.5) and mention ‘perfect’ graphs. Then we prove the two main theorems about colourings of vertices and edges (namely the Theorems of Brooks and Vizing). Finally, we consider edge colourings of Cayley graphs; these are graphs which are defined using groups. We will 作者: 性學(xué)院 時(shí)間: 2025-3-23 14:18 作者: neutral-posture 時(shí)間: 2025-3-23 19:15
https://doi.org/10.1007/978-3-663-10697-5For given conditions on the flow, construct a network (with as little effort as possible) on which such a flow would be possible. On the one hand, we consider the case where all edges can be built with the same cost and we are looking for an undirected network with lower bounds on the maximal values作者: Phonophobia 時(shí)間: 2025-3-24 01:24
https://doi.org/10.1007/978-3-662-66171-0gorithm of Moore (BFS) we presented in Chapter 3 is an efficient method for determining the connected components of a graph. Now, in the present chapter, we mainly treat algorithmic questions concerning .-connectivity and strong connectivity for directed graphs. We develop a further strategy for sea作者: 詼諧 時(shí)間: 2025-3-24 03:34
https://doi.org/10.1007/978-3-662-58180-3e bipartite case, the general case cannot be reduced immediately to a flow problem. However, we will see that the notion of an augmenting path can be modified appropriately. Kocay and Stone (1993) and Kocay and Stone (1995) showed that matchings can be treated in the context of Flow Theory by introd作者: 刺穿 時(shí)間: 2025-3-24 09:16
https://doi.org/10.1007/978-3-662-58449-1n particular to the problem of how to determine a matching of maximal weight in some network (.) (‘weighted matching’). In the bipartite case, this problem is equivalent to the ‘a(chǎn)ssignment problem’ (see Example 9.1.4), so that the methods introduced in Chapter 9 can be applied. However, we give a fu作者: 寒冷 時(shí)間: 2025-3-24 11:55 作者: 外來 時(shí)間: 2025-3-24 17:49
https://doi.org/10.1007/978-3-662-47035-0ution, whereas for easy ones, we sometimes restrict ourselves to hints. If an exercise is a purely arithmetical problem, we state the result only. For some exercises, where the result is known already (from earlier considerations) or where the reader was required to do some experiments, we do not gi作者: Interim 時(shí)間: 2025-3-24 22:29 作者: Lucubrate 時(shí)間: 2025-3-25 01:28
Shortest Paths,german motorways in the official guide ‘Autobahn Service’, the railroad or bus lines in some system of public transportation, or the network of routes an airline offers are represented as graphs without anybody being aware of it. Thus, it is obviously of great practical interest to study paths in su作者: Critical 時(shí)間: 2025-3-25 06:02 作者: apropos 時(shí)間: 2025-3-25 08:21
The Greedy Algorithm,on ‘independence systems’ (as, for example, in the case of the Algorithm of Kruskal, the system of spanning forests of a graph). However, the strategy used is rather short-sighted: we always choose the element which seems best at the moment (that is, of all the admissible elements, we choose the ele作者: 粉筆 時(shí)間: 2025-3-25 12:38
Flows, the connections are given? Such a network might be a model for a system of pipelines or a water supply system or for a system of roads. The theory of flows is one of the most important parts of Combinatorial Optimization; it has various applications as well in Mathematics as in other fields. The bo作者: largesse 時(shí)間: 2025-3-25 16:42 作者: ALLEY 時(shí)間: 2025-3-25 20:48 作者: 圓木可阻礙 時(shí)間: 2025-3-26 02:34
Circulations,various applications of this theory. The present chapter treats generalizations of the flows we worked with so far. For example, it occurs quite often that, for some network, there are lower bounds on the capacities of the edges or a cost function on the edges given as well. To solve this kind of pr作者: Injunction 時(shí)間: 2025-3-26 06:48
Synthesis of Networks,For given conditions on the flow, construct a network (with as little effort as possible) on which such a flow would be possible. On the one hand, we consider the case where all edges can be built with the same cost and we are looking for an undirected network with lower bounds on the maximal values作者: 不要不誠實(shí) 時(shí)間: 2025-3-26 10:39
Connectivity,gorithm of Moore (BFS) we presented in Chapter 3 is an efficient method for determining the connected components of a graph. Now, in the present chapter, we mainly treat algorithmic questions concerning .-connectivity and strong connectivity for directed graphs. We develop a further strategy for sea作者: critic 時(shí)間: 2025-3-26 12:58 作者: Generator 時(shí)間: 2025-3-26 17:31
Weighted Matchings,n particular to the problem of how to determine a matching of maximal weight in some network (.) (‘weighted matching’). In the bipartite case, this problem is equivalent to the ‘a(chǎn)ssignment problem’ (see Example 9.1.4), so that the methods introduced in Chapter 9 can be applied. However, we give a fu作者: jungle 時(shí)間: 2025-3-27 00:01 作者: 激怒某人 時(shí)間: 2025-3-27 04:44
Solutions,ution, whereas for easy ones, we sometimes restrict ourselves to hints. If an exercise is a purely arithmetical problem, we state the result only. For some exercises, where the result is known already (from earlier considerations) or where the reader was required to do some experiments, we do not gi作者: 我們的面粉 時(shí)間: 2025-3-27 05:16 作者: jumble 時(shí)間: 2025-3-27 10:04
https://doi.org/10.1007/978-3-8350-9108-5olution. In fact, this class of structures is characterized by the fact that the Greedy Algorithm works for them, but there are other possible definitions for matroids. We will see some other characterizations of matroids and look at the notion of duality of matroids.作者: 大喘氣 時(shí)間: 2025-3-27 16:18 作者: Oligarchy 時(shí)間: 2025-3-27 20:13 作者: 寬容 時(shí)間: 2025-3-27 23:06 作者: Obscure 時(shí)間: 2025-3-28 03:38 作者: fiction 時(shí)間: 2025-3-28 06:33
Colourings,y the Theorems of Brooks and Vizing). Finally, we consider edge colourings of Cayley graphs; these are graphs which are defined using groups. We will barely scractch the surface of a vast area in this chapter; for a detailed study of colouring problems we refer the reader to the monograph by Jensen and Toft (1995).作者: Notify 時(shí)間: 2025-3-28 12:20 作者: 圍裙 時(shí)間: 2025-3-28 17:05
Myxozoan Evolution, Ecology and Developmenty the Theorems of Brooks and Vizing). Finally, we consider edge colourings of Cayley graphs; these are graphs which are defined using groups. We will barely scractch the surface of a vast area in this chapter; for a detailed study of colouring problems we refer the reader to the monograph by Jensen and Toft (1995).作者: magnate 時(shí)間: 2025-3-28 22:42 作者: Cocker 時(shí)間: 2025-3-29 00:33
Zhaoyuan Tian,Shuxian Ye,Hang Qianired, sometimes we want the cheapest path or the one which is ‘safest’ (for example, we want the route where it is most unlikely that we encounter a speed control installation). We will mainly consider shortest paths in (directed) graphs in this chapter, and we will see that this question is not only of interest in traffic networks.作者: Microaneurysm 時(shí)間: 2025-3-29 06:23
https://doi.org/10.1057/9781137358639monograph by Ahuja, Magnanti and Orlin (1993). In Chapter 7, we will see several applications of the theory of flows within Combinatorics, and flows and related notions will appear again and again during the remainder of this book.作者: 靈敏 時(shí)間: 2025-3-29 07:26 作者: patriot 時(shí)間: 2025-3-29 13:30 作者: Gentry 時(shí)間: 2025-3-29 18:56 作者: 在駕駛 時(shí)間: 2025-3-29 22:06
https://doi.org/10.1007/978-3-662-66169-7heuristics, relaxations, post-optimization, local optimums, complete enumeration and several more. We explain all the techniques by using the TSP which can serve as a paradigm for a difficult problem.作者: Debark 時(shí)間: 2025-3-30 01:01
Shortest Paths,ired, sometimes we want the cheapest path or the one which is ‘safest’ (for example, we want the route where it is most unlikely that we encounter a speed control installation). We will mainly consider shortest paths in (directed) graphs in this chapter, and we will see that this question is not only of interest in traffic networks.作者: Servile 時(shí)間: 2025-3-30 04:44 作者: 散布 時(shí)間: 2025-3-30 08:37 作者: 遣返回國 時(shí)間: 2025-3-30 12:48
Synthesis of Networks,n interesting application for the construction of certain communication networks; this is discussed in Section 10.4. On the other hand, we look at the question of how to increase the maximal value of the flow for a given flow network by increasing the capacities of some edges as economically as possible.作者: dowagers-hump 時(shí)間: 2025-3-30 17:42 作者: paltry 時(shí)間: 2025-3-31 00:47
A Hard Problem: The TSP,heuristics, relaxations, post-optimization, local optimums, complete enumeration and several more. We explain all the techniques by using the TSP which can serve as a paradigm for a difficult problem.作者: 搏斗 時(shí)間: 2025-3-31 03:47
Graphs, Networks and Algorithms978-3-662-03822-2Series ISSN 1431-1550 作者: Vertebra 時(shí)間: 2025-3-31 07:12 作者: resilience 時(shí)間: 2025-3-31 12:29 作者: gusher 時(shí)間: 2025-3-31 17:01 作者: Aggrandize 時(shí)間: 2025-3-31 19:56
https://doi.org/10.1007/978-3-322-92624-1This first part of the list contains some general symbols which are more or less standard. The special symbols of Graph and Matroid Theory will be treated in the next section.
