Titlebook: ;

小天使

书目名称Graphs, Networks and Algorithms影响因子(影响力)




书目名称Graphs, Networks and Algorithms影响因子(影响力)学科排名




书目名称Graphs, Networks and Algorithms网络公开度




书目名称Graphs, Networks and Algorithms网络公开度学科排名




书目名称Graphs, Networks and Algorithms被引频次




书目名称Graphs, Networks and Algorithms被引频次学科排名




书目名称Graphs, Networks and Algorithms年度引用




书目名称Graphs, Networks and Algorithms年度引用学科排名




书目名称Graphs, Networks and Algorithms读者反馈




书目名称Graphs, Networks and Algorithms读者反馈学科排名

终止

勤勉

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

天文台

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

课程

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

课程

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

一大块

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

闷热

AVANT

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