書目名稱Graphs, Networks and Algorithms網(wǎng)絡(luò)公開度
書目名稱Graphs, Networks and Algorithms網(wǎng)絡(luò)公開度學科排名
書目名稱Graphs, Networks and Algorithms被引頻次
書目名稱Graphs, Networks and Algorithms被引頻次學科排名
書目名稱Graphs, Networks and Algorithms年度引用
書目名稱Graphs, Networks and Algorithms年度引用學科排名
書目名稱Graphs, Networks and Algorithms讀者反饋
書目名稱Graphs, Networks and Algorithms讀者反饋學科排名
作者: 陳舊 時間: 2025-3-21 20:28
Basic Graph Theory,n 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. Euler realized that the precise shapes of the island and the other three territories involved are not important; the solvability depends only on their connection 作者: Macronutrients 時間: 2025-3-22 01:08
Algorithms and Complexity,r some basic aspects of graph theoretic algorithms such as, for example, the problem of how to represent a graph. Moreover, we need a way to formulate the algorithms we deal with. We shall illustrate and study these concepts quite thoroughly using two specific examples, namely Euler tours and acycli作者: 使隔離 時間: 2025-3-22 04:41
Shortest Paths,e German motorway system in the official guide, the railroad or bus lines in a 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 often 作者: 四指套 時間: 2025-3-22 10:13
Spanning Trees,nt chapter, we will study this important class of graphs in considerably more detail. After some further characterizations of trees, we shall study another way of determining the number of trees on . vertices which actually applies more generally: it allows one to compute the number of spanning tree作者: 謙虛的人 時間: 2025-3-22 16:18 作者: 謙虛的人 時間: 2025-3-22 17:28 作者: 追逐 時間: 2025-3-22 21:32
Combinatorial Applications,se ow theory to study disjoint paths in graphs, matchings in bipartite graphs, transversals of set families, the combinatorics of matrices, partitions of directed graphs, partially ordered sets, parallelisms of complete designs, and the supply and demand theorem. In particular, transversal theory ca作者: Wallow 時間: 2025-3-23 04:07
Connectivity and Depth First Search, method for determining the connected components of a graph: breadth first search (BFS). 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 作者: 繁重 時間: 2025-3-23 09:32
Colorings,y the theorem 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 usi作者: 從屬 時間: 2025-3-23 12:58 作者: Congregate 時間: 2025-3-23 17:33
The Network Simplex Algorithm,ts 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. Nev作者: Excitotoxin 時間: 2025-3-23 18:59 作者: 搏斗 時間: 2025-3-23 22:37 作者: Needlework 時間: 2025-3-24 03:04 作者: 碌碌之人 時間: 2025-3-24 07:18 作者: Manifest 時間: 2025-3-24 11:03 作者: 過份好問 時間: 2025-3-24 18:02
https://doi.org/10.1007/978-3-531-91853-2r some basic aspects of graph theoretic algorithms such as, for example, the problem of how to represent a graph. Moreover, we need a way to formulate the algorithms we deal with. We shall illustrate and study these concepts quite thoroughly using two specific examples, namely Euler tours and acycli作者: 使成核 時間: 2025-3-24 21:32
https://doi.org/10.1007/978-3-663-14591-2e German motorway system in the official guide, the railroad or bus lines in a 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 often 作者: pancreas 時間: 2025-3-25 01:19
https://doi.org/10.1007/978-3-663-14368-0nt chapter, we will study this important class of graphs in considerably more detail. After some further characterizations of trees, we shall study another way of determining the number of trees on . vertices which actually applies more generally: it allows one to compute the number of spanning tree作者: 黃瓜 時間: 2025-3-25 03:48
https://doi.org/10.1007/978-3-531-91121-2 weight function on so-called independence systems, the classical instance being the system of spanning forests of a graph. The greedy strategy is rather short-sighted: one always selects the element which seems best at the moment. In other words, among all the admissible elements, one chooses that 作者: Ornament 時間: 2025-3-25 09:35 作者: tooth-decay 時間: 2025-3-25 15:23 作者: affect 時間: 2025-3-25 18:03
M?dchenfreundschaften in der Adoleszenz method for determining the connected components of a graph: breadth first search (BFS). 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 作者: 入會 時間: 2025-3-25 20:22 作者: 正式通知 時間: 2025-3-26 02:09
M?dchenliteratur der Kaiserzeit?., we studied various important applications of this theory. The present chapter deals with generalizations of the.ows we worked with so far. For example, quite often there are also lower bounds on the capacities of the edges given; or one may seek a maximal ow which is optimal with respect to a gi作者: 駭人 時間: 2025-3-26 06:05
M?ngelansprüche nach VOB und BGBts 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. Nev作者: 埋葬 時間: 2025-3-26 09:02
M?nner - die ewigen Gewaltt?ter?a network—as economically as possible—on which a ow meeting given requirements can be realized. In practical terms, one might think of planning a system of roads. In the present chapter, we shall mainly study two types of network design problems. On the one hand, we consider the case where all edges作者: 類似思想 時間: 2025-3-26 15:02
https://doi.org/10.1007/978-3-663-04264-8n in Sect.?.. In contrast to this case, it is not at all easy to reduce the general case to a ow problem, though this is possible (but beyond the scope of the present book). Nevertheless, we will see that the notion of an augmenting path can be modiffied appropriately to help enlarge a given matchin作者: reptile 時間: 2025-3-26 17:03
https://doi.org/10.1007/978-3-531-18768-6em of finding a matching of maximal weight (with respect to a given weight function on the edges). In the bipartite case, this problem is equivalent to the assignment problem considered before, so that the methods discussed in Chap.?. apply. Nevertheless, we will give a further algorithm for the bip作者: Systemic 時間: 2025-3-26 23:56
M?nner - die ewigen Gewaltt?ter?chapter deals with an archetypical NP-complete problem: the travelling salesman problem already introduced in Chap.?.. It is one of the most famous and important problems in all of combinatorial optimization—with manyfold applications in such diverse areas as logistics, genetics, telecommunications,作者: Explosive 時間: 2025-3-27 01:19 作者: 征稅 時間: 2025-3-27 09:09
https://doi.org/10.1007/978-3-663-14591-2ll present some useful theoretical concepts (e.g.,?the Bellman equations, shortest path threes, and path algebras) as well as the most important algorithms for finding shortest paths (in?particular, breadth first search, the algorithm of Dijkstra, and the algorithm of Floyd and Warshall). We also di作者: A保存的 時間: 2025-3-27 10:12
https://doi.org/10.1007/978-3-663-14368-0tates how much it would cost to build that connection. Other possible interpretations are tasks like establishing traffic connections (for cars, trains or planes) or designing a network for TV broadcasts. We shall present an interesting characterization of minimal spanning trees and use this criteri作者: Substance 時間: 2025-3-27 16:33 作者: 單片眼鏡 時間: 2025-3-27 18:56
M?dchenliteratur der Kaiserzeiteory of maximal ows as presented before; nevertheless, the methods of Chap.?. will serve as fundamental tools for the more general setting. We shall begin with a rather thorough theoretical investigation of circulations and then develop efficient algorithms for finding an optimal circulation (or sho作者: 全國性 時間: 2025-3-27 22:44 作者: THROB 時間: 2025-3-28 04:00 作者: Kindle 時間: 2025-3-28 06:29 作者: QUAIL 時間: 2025-3-28 12:03 作者: SEED 時間: 2025-3-28 18:34
Shortest Paths,ll present some useful theoretical concepts (e.g.,?the Bellman equations, shortest path threes, and path algebras) as well as the most important algorithms for finding shortest paths (in?particular, breadth first search, the algorithm of Dijkstra, and the algorithm of Floyd and Warshall). We also di作者: 燒烤 時間: 2025-3-28 22:10 作者: 懶惰人民 時間: 2025-3-28 23:11 作者: 嚴厲批評 時間: 2025-3-29 05:41 作者: LAVE 時間: 2025-3-29 07:51
The Network Simplex Algorithm,al interest admit easy transformations to this problem. Throughout this book, we emphasize the graph theoretical aspects of combinatorial optimization while avoiding the theory of linear programming as much as possible. In view of this philosophy, it is very fortunate that the network simplex algori作者: Pander 時間: 2025-3-29 11:50
Weighted Matchings,he corresponding polytope, and ultimately to the total unimodularity of the incidence matrix of a bipartite graph. In this context, the reason why the determination of maximal matchings (weighted or not) is considerably more difficult for arbitrary graphs than for bipartite ones will become apparent作者: ascend 時間: 2025-3-29 19:09
A Hard Problem: The TSP,on, local search, and complete enumeration. We shall explain these methods only for the TSP, but they are typical for dealing with hard problems in general. We will also brie y explain the idea of a further extremely important approach—via polyhedra—to solving hard problems and present a list of not作者: 顧客 時間: 2025-3-29 22:55 作者: 施舍 時間: 2025-3-30 02:20
Forschung Erziehungswissenschaftl alternative approach of taking Philip Hall’s marriage theorem—which we will treat in Sect.?.—as the starting point of transversal theory, this way of proceeding has a distinct advantage: it also yields algorithms allowing explicit constructions for the objects in question.作者: 無意 時間: 2025-3-30 07:47 作者: ROOF 時間: 2025-3-30 12:13
Flows, importance, we shall discuss network flows in considerable depth. In particular, we will give detailed presentations of four of the most important algorithms solving this problem, namely the labelling algorithm of Ford and Fulkerson, the algorithm of Dinic, the MKM-algorithm, and the preflow-push algorithm of Goldberg and Tarjan.作者: 愛了嗎 時間: 2025-3-30 16:26
Combinatorial Applications,l alternative approach of taking Philip Hall’s marriage theorem—which we will treat in Sect.?.—as the starting point of transversal theory, this way of proceeding has a distinct advantage: it also yields algorithms allowing explicit constructions for the objects in question.作者: crutch 時間: 2025-3-30 16:57
Matchings,n in the bipartite case. We shall also present the most important theoretical results on matchings in general graphs: the 1-factor theorem of Tutte characterizing the graphs with a prefect matching, the more general Berge-Tutte formula giving the size of a maximal matching, and the Gallai-Edmonds structure theory.作者: Vaginismus 時間: 2025-3-31 00:40
https://doi.org/10.1007/978-3-531-91853-2c digraphs. At the end of the chapter we consider a class of apparently very difficult problems (the so-called NP-complete problems) which plays a central role in complexity theory; we will meet this type of problem over and over again in this book.作者: 怎樣才咆哮 時間: 2025-3-31 04:53
M?dchenfreundschaften in der AdoleszenzBFS), namely depth first search—which may also be thought of as a strategy for traversing a maze. In addition, we present various theoretical results, such as characterizations of 2-connected graphs and of edge connectivity.作者: SPER 時間: 2025-3-31 07:31
Algorithms and Complexity,c digraphs. At the end of the chapter we consider a class of apparently very difficult problems (the so-called NP-complete problems) which plays a central role in complexity theory; we will meet this type of problem over and over again in this book.作者: novelty 時間: 2025-3-31 11:09
Connectivity and Depth First Search,BFS), namely depth first search—which may also be thought of as a strategy for traversing a maze. In addition, we present various theoretical results, such as characterizations of 2-connected graphs and of edge connectivity.
