書目名稱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é)科排名
作者: Arboreal 時(shí)間: 2025-3-21 23:27
https://doi.org/10.1007/978-3-322-99954-2Graph theory began in 1736 when Leonhard Euler (1707–1783) solved the wellknown . [Eul36]. This problem asked for a circular walk through the town of K?nigsberg (now Kaliningrad) in such a way as to cross over each of the seven bridges spanning the river Pregel once, and only once; see Figure 1.1 for a rough sketch of the situation.作者: 紋章 時(shí)間: 2025-3-22 02:05 作者: isotope 時(shí)間: 2025-3-22 05:31
Basic Graph Theory,Graph theory began in 1736 when Leonhard Euler (1707–1783) solved the wellknown . [Eul36]. This problem asked for a circular walk through the town of K?nigsberg (now Kaliningrad) in such a way as to cross over each of the seven bridges spanning the river Pregel once, and only once; see Figure 1.1 for a rough sketch of the situation.作者: Expiration 時(shí)間: 2025-3-22 12:14
Matchings,This chapter is devoted to the problem of finding maximal matchings in arbitrary graphs; the bipartite case was treated in Section 7.2. In contrast to the bipartite case, it is not at all easy to reduce the general case to a flow problem. However, we will see that the notion of an augmenting path can be modified appropriately.作者: 黃瓜 時(shí)間: 2025-3-22 12:52 作者: 黃瓜 時(shí)間: 2025-3-22 19:55 作者: Rankle 時(shí)間: 2025-3-22 23:37 作者: 草率女 時(shí)間: 2025-3-23 02:30 作者: aerial 時(shí)間: 2025-3-23 05:56
https://doi.org/10.1007/978-3-658-22579-7ization, the so-called ., it indeed leads to optimal solutions. Actually, matroids may be characterized by the fact that the greedy algorithm works for them, but there are other possible definitions.We will look at various other characterizations of matroids and also consider the notion of matroid duality.作者: meditation 時(shí)間: 2025-3-23 12:21 作者: OVER 時(shí)間: 2025-3-23 14:35
M?rkte für Krankenhausdienstleistungeneads to the notion of . on directed graphs. As we will see, there are many interesting applications of this more general concept. To a large part, these cannot be treated using the theory of maximal flows as presented before; nevertheless, the methods of Chapter 6 will serve as fundamental tools for the more general setting.作者: pulmonary 時(shí)間: 2025-3-23 21:00 作者: Deject 時(shí)間: 2025-3-24 00:38
Shortest Paths,t path or the one which is safest – for example, we might want the route where we are least likely to encounter a speed-control installation. Thus we will study shortest paths in graphs and digraphs in this chapter; as we shall see, this is a topic whose interest extends beyond traffic networks.作者: 圍裙 時(shí)間: 2025-3-24 04:01 作者: 多山 時(shí)間: 2025-3-24 07:24
Combinatorial Applications,tructions.We shall study disjoint paths in graphs, matchings in bipartite graphs, transversals, the combinatorics of matrices, partitions of directed graphs, partially ordered sets, parallelisms, and the supply and demand theorem.作者: gerrymander 時(shí)間: 2025-3-24 12:55
Circulations,eads to the notion of . on directed graphs. As we will see, there are many interesting applications of this more general concept. To a large part, these cannot be treated using the theory of maximal flows as presented before; nevertheless, the methods of Chapter 6 will serve as fundamental tools for the more general setting.作者: Factorable 時(shí)間: 2025-3-24 15:53 作者: Injunction 時(shí)間: 2025-3-24 22:51
https://doi.org/10.1007/978-3-476-04224-8it would cost to build that connection. Other possible interpretations are tasks like establishing traffic connections (for cars, trains or planes: the .) or designing a network for TV broadcasts. Finally, we consider Steiner trees (these are trees where it is allowed to add some new vertices) and arborescences (directed trees).作者: Systemic 時(shí)間: 2025-3-24 23:43
Spanning Trees,it would cost to build that connection. Other possible interpretations are tasks like establishing traffic connections (for cars, trains or planes: the .) or designing a network for TV broadcasts. Finally, we consider Steiner trees (these are trees where it is allowed to add some new vertices) and arborescences (directed trees).作者: Semblance 時(shí)間: 2025-3-25 06:17
M?rkte der langfristigen Fremdfinanzierungnd flows and related notions will appear again and again throughout the book. The once standard reference, . by Ford and Fulkerson [FoFu62], is still worth reading; an extensive, more recent treatment is provided in [AhMO93].作者: Pedagogy 時(shí)間: 2025-3-25 07:46
https://doi.org/10.1007/978-3-658-13425-9g groups. Finally, we turn to map colorings: we shall prove Heawood’s five color theorem and report on the famous four color theorem. Our discussion barely scratches the surface of the vast area; for a detailed study of coloring problems we refer the reader to the monograph [JeTo95].作者: Aids209 時(shí)間: 2025-3-25 13:27 作者: 五行打油詩 時(shí)間: 2025-3-25 18:45 作者: Conflict 時(shí)間: 2025-3-25 20:29 作者: Inkling 時(shí)間: 2025-3-26 04:11 作者: glowing 時(shí)間: 2025-3-26 06:12 作者: cylinder 時(shí)間: 2025-3-26 08:44
https://doi.org/10.1007/978-3-663-08732-8s. This suggests trying to apply this algorithm also to problems from graph theory. Indeed, the most important network optimization problems may be formulated in terms of linear programs; this holds, for instance, for the determination of shortest paths, maximal flows, optimal flows, and optimal circulations.作者: HAIRY 時(shí)間: 2025-3-26 15:31
https://doi.org/10.1007/978-3-322-92306-6oduced in Example 10.1.4, so that the methods discussed in Chapter 10 apply. Nevertheless, we will give a further algorithm for the bipartite case, the ., which is one of the best known and most important combinatorial algorithms.作者: exophthalmos 時(shí)間: 2025-3-26 19:48 作者: 懶惰人民 時(shí)間: 2025-3-27 00:17 作者: 細(xì)絲 時(shí)間: 2025-3-27 04:54
https://doi.org/10.1007/978-3-476-04224-8f trees, we then present another way of determining the number of trees on . vertices which actually applies more generally: it allows us to compute the number of spanning trees in any given connected graph. The major part of this chapter is devoted to a network optimization problem, namely to findi作者: 沒花的是打擾 時(shí)間: 2025-3-27 08:43 作者: Paraplegia 時(shí)間: 2025-3-27 12:50 作者: occurrence 時(shí)間: 2025-3-27 17:24 作者: 一個(gè)姐姐 時(shí)間: 2025-3-27 19:05
M?rkte der langfristigen Fremdfinanzierungconnected components of a graph: breadth first search. In the present chapter, we mainly treat algorithmic questions concerning .-connectivity and strong connectivity. To this end, we introduce a further important strategy for searching graphs and digraphs (besides BFS), namely .. In addition, we pr作者: reserve 時(shí)間: 2025-3-27 22:31
https://doi.org/10.1007/978-3-658-13425-9the theorems of Brooks on vertex colorings and the theorem of Vizing on edge colorings. As an aside, we explain the relationship between colorings and partial orderings, and briefly discuss perfect graphs. Moreover, we consider edge colorings of Cayley graphs; these are graphs which are defined usin作者: grovel 時(shí)間: 2025-3-28 02:58
M?rkte für Krankenhausdienstleistungenarious applications of this theory. The present chapter deals with generalizations of the flows we worked with so far. For example, quite often there are also lower bounds on the capacities of the edges given, or a cost function on the edges. To solve this kind of problem, it makes sense to remove t作者: vector 時(shí)間: 2025-3-28 06:30 作者: 蒸發(fā) 時(shí)間: 2025-3-28 12:51
https://doi.org/10.1007/978-3-658-21771-6(as economically as possible) on which a flow meeting given requirements can be realized. On the one hand, we will consider the case where all edges may be built with the same cost, and where we are looking for an undirected network with lower bounds on the maximal values of a flow between any two v作者: arbovirus 時(shí)間: 2025-3-28 14:41 作者: climax 時(shí)間: 2025-3-28 19:54 作者: Innovative 時(shí)間: 2025-3-28 23:27
Algorithms and Complexity, is easy to verify for any given graph. But how can we really find an Euler tour in an Eulerian graph? The proof of Theorem 1.3.1 not only guarantees that such a tour exists, but actually contains a hint how to construct such a tour. We want to convert this hint into a general method for constructin作者: bypass 時(shí)間: 2025-3-29 06:15
Shortest Paths,e German motorway system in the official guide ., the railroad or bus lines in some public transportation system, and the network of routes an airline offers are routinely represented by graphs. Therefore it is obviously of great practical interest to study paths in such graphs. In particular, we of作者: 返老還童 時(shí)間: 2025-3-29 09:47
Spanning Trees,f trees, we then present another way of determining the number of trees on . vertices which actually applies more generally: it allows us to compute the number of spanning trees in any given connected graph. The major part of this chapter is devoted to a network optimization problem, namely to findi作者: lipids 時(shí)間: 2025-3-29 11:23 作者: 即席 時(shí)間: 2025-3-29 19:20
Flows,network might model a system of pipelines, a water supply system, or a system of roads. With its many applications, the theory of flows is one of the most important parts of combinatorial optimization. In Chapter 7 we will encounter several applications of the theory of flows within combinatorics, a作者: Ccu106 時(shí)間: 2025-3-29 20:20
Combinatorial Applications,sal theory can be developed from the theory of flows on networks; this approach was first suggested in the book by Ford and Fulkerson [FoFu62] and is also used in the survey [Jun86]. Compared with the usual approach [Mir71b] of taking Philip Hall’s marriage theorem [Hal35] – which we will treat in S作者: Myocarditis 時(shí)間: 2025-3-30 00:34
Connectivity and Depth First Search,connected components of a graph: breadth first search. In the present chapter, we mainly treat algorithmic questions concerning .-connectivity and strong connectivity. To this end, we introduce a further important strategy for searching graphs and digraphs (besides BFS), namely .. In addition, we pr作者: Aggressive 時(shí)間: 2025-3-30 04:14
Colorings,the theorems of Brooks on vertex colorings and the theorem of Vizing on edge colorings. As an aside, we explain the relationship between colorings and partial orderings, and briefly discuss perfect graphs. Moreover, we consider edge colorings of Cayley graphs; these are graphs which are defined usin作者: Vasodilation 時(shí)間: 2025-3-30 10:34 作者: JECT 時(shí)間: 2025-3-30 15:01 作者: anthropologist 時(shí)間: 2025-3-30 19:14
Synthesis of Networks,(as economically as possible) on which a flow meeting given requirements can be realized. On the one hand, we will consider the case where all edges may be built with the same cost, and where we are looking for an undirected network with lower bounds on the maximal values of a flow between any two v作者: 敲詐 時(shí)間: 2025-3-31 00:10
Weighted matchings,lem of finding a matching of maximal weight in a network (.) (the .). In the bipartite case, this problem is equivalent to the assignment problem introduced in Example 10.1.4, so that the methods discussed in Chapter 10 apply. Nevertheless, we will give a further algorithm for the bipartite case, th
