Titlebook: ;

GERM

書(shū)目名稱Graphs, Networks and Algorithms影響因子(影響力)




書(shū)目名稱Graphs, Networks and Algorithms影響因子(影響力)學(xué)科排名




書(shū)目名稱Graphs, Networks and Algorithms網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Graphs, Networks and Algorithms網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Graphs, Networks and Algorithms被引頻次




書(shū)目名稱Graphs, Networks and Algorithms被引頻次學(xué)科排名




書(shū)目名稱Graphs, Networks and Algorithms年度引用




書(shū)目名稱Graphs, Networks and Algorithms年度引用學(xué)科排名




書(shū)目名稱Graphs, Networks and Algorithms讀者反饋




書(shū)目名稱Graphs, Networks and Algorithms讀者反饋學(xué)科排名

陳舊

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

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

使隔離

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

四指套

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

謙虛的人

謙虛的人

追逐

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

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

繁重

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