標題: Titlebook: Digraphs; Theory, Algorithms a J?rgen Bang-Jensen,Gregory Gutin Book 20021st edition Springer-Verlag London 2002 Applications.Directed Grap [打印本頁] 作者: retort 時間: 2025-3-21 19:25
書目名稱Digraphs影響因子(影響力)
書目名稱Digraphs影響因子(影響力)學(xué)科排名
書目名稱Digraphs網(wǎng)絡(luò)公開度
書目名稱Digraphs網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Digraphs被引頻次
書目名稱Digraphs被引頻次學(xué)科排名
書目名稱Digraphs年度引用
書目名稱Digraphs年度引用學(xué)科排名
書目名稱Digraphs讀者反饋
書目名稱Digraphs讀者反饋學(xué)科排名
作者: 夸張 時間: 2025-3-21 23:03
Orientations of Graphs,s which generalizes standard flows in networks and turns out to be a very useful tool (not only theoretically, but also algorithmically) for certain types of connectivity questions as well as orientation problems. We illustrate this by applying the submodular flow techniques to questions about orien作者: 貿(mào)易 時間: 2025-3-22 03:25
for the case of undirected graphs, for which there are several important books covering both classical and recent results, no previous book covers more than a small fraction of the results obtained on digraphs within the last 25 years. Typically, digraphs are consid- ered only in one chapter or by a few elemen978-1-4471-3886-0作者: CURL 時間: 2025-3-22 08:18
Andreas Schr?er,Steffen Sigmunds which generalizes standard flows in networks and turns out to be a very useful tool (not only theoretically, but also algorithmically) for certain types of connectivity questions as well as orientation problems. We illustrate this by applying the submodular flow techniques to questions about orien作者: 焦慮 時間: 2025-3-22 12:13 作者: aerial 時間: 2025-3-22 13:43 作者: aerial 時間: 2025-3-22 17:44
Additional Topics,a whole chapter by themselves. Yet we think that our modest coverage will still show the flavour and potential usefulness of these topics. This applies in particular to the sections on matroids and heuristics for obtaining good solutions to .-hard problems.作者: 誘導(dǎo) 時間: 2025-3-22 23:02
Book 20021st editiontical problems. As a research area, graph theory is still relatively young, but it is maturing rapidly with many deep results having been discovered over the last couple of decades. The theory of graphs can be roughly partitioned into two branches: the areas of undirected graphs and directed graphs 作者: insightful 時間: 2025-3-23 02:37
material: Graph theory is a very popular area of discrete mathematics with not only numerous theoretical developments, but also countless applications to prac- tical problems. As a research area, graph theory is still relatively young, but it is maturing rapidly with many deep results having been d作者: 有權(quán) 時間: 2025-3-23 08:48 作者: omnibus 時間: 2025-3-23 11:29
Landschaftsplanerische Perspektivenhe previous chapters, we discuss these topics in this chapter. We will mostly consider (directed) cycles; in most cases the adjective ‘directed’ is omitted. Sometimes we will use oriented cycles, i.e. orientations of undirected cycles.作者: Cholagogue 時間: 2025-3-23 14:11 作者: 誘騙 時間: 2025-3-23 18:10
Gruppenstruktur und Interaktionsproze?flow from a given source to a given sink or characterizing the size of such a flow, are concerned. However, the topic is still a very active research field and there are challenging open problems such as deciding whether an .(.)algorithm. exists for the general maximum flow problem.作者: collateral 時間: 2025-3-24 00:36
https://doi.org/10.1007/978-3-531-94105-9cause of the very large number of important results on connectivity, we will devote this chapter as well as Chapters 8 and 9 to this area. This chapter will mainly deal with global connectivity aspects. That is, the directed multigraph in question is .-(arc)-strong for some . ≥ 0, or we want to make it .-(arc)-strong by adding new arcs.作者: FUSE 時間: 2025-3-24 04:18
https://doi.org/10.1007/978-3-658-45231-5hs by substituting arbitrary digraphs for each vertex of the semicomplete digraph. We briefly discuss the .-path problem for planar digraphs and indicate how to use the topological concept of planarity in proofs and algorithms for disjoint path problems in planar digraphs.作者: dithiolethione 時間: 2025-3-24 10:11 作者: covert 時間: 2025-3-24 11:46 作者: nautical 時間: 2025-3-24 16:37
Disjoint Paths and Trees,hs by substituting arbitrary digraphs for each vertex of the semicomplete digraph. We briefly discuss the .-path problem for planar digraphs and indicate how to use the topological concept of planarity in proofs and algorithms for disjoint path problems in planar digraphs.作者: declamation 時間: 2025-3-24 22:22 作者: 多嘴多舌 時間: 2025-3-25 00:54
Classes of Digraphs,t to their characterization, recognition and decomposition. We also consider some basic properties of these classes. Further properties of the classes are studied in the following chapters of this book.作者: ACTIN 時間: 2025-3-25 06:43
Generalizations of Digraphs,t some results remain the same with respect to their formulation, but their proofs become much more involved. Other results do not hold any more. This gives an additional insight to the theory of digraphs. In particular, we can more clearly see which properties of digraphs allow us to obtain various results on them.作者: 同位素 時間: 2025-3-25 10:19
https://doi.org/10.1007/978-1-4471-3886-0Applications; Directed Graphs; Notation; Theory; algorithms; diagraphs; flows and connectivity; graph; graph作者: 模范 時間: 2025-3-25 12:50 作者: BILL 時間: 2025-3-25 18:12
Markus Strauch,Andreas Schr?er,Bj?rn SchmitzIn this chapter we will consider the hamiltonian path and cycle problems for digraphs as well as some related problems such as the longest path and cycle problems and the minimum path factor problem. We describe and prove a number of results in the area as well as formulate several open questions.作者: debris 時間: 2025-3-25 21:15
https://doi.org/10.1007/978-3-531-94105-9In this chapter we discuss results which in one way or another generalize the notion of hamiltonicity. As can be seen from the content of the chapter, there are quite a number of such topics. In fact many more could be added, but we feel that the ones included here are representative.作者: Tidious 時間: 2025-3-26 00:34 作者: Esophagus 時間: 2025-3-26 04:55
Hamiltonian Refinements,In this chapter we discuss results which in one way or another generalize the notion of hamiltonicity. As can be seen from the content of the chapter, there are quite a number of such topics. In fact many more could be added, but we feel that the ones included here are representative.作者: 龍蝦 時間: 2025-3-26 10:25 作者: Infelicity 時間: 2025-3-26 13:16 作者: alleviate 時間: 2025-3-26 20:46
Gruppenstruktur und Interaktionsproze?ingle tool for applications of digraphs and perhaps even of graphs as a whole. At the same time, from a theoretical point of view, flow problems constitute a beautiful common generalization of shortest path problems and problems such as finding internally (arc)-disjoint paths from a given vertex to 作者: 吸引力 時間: 2025-3-26 22:16
Beitr?ge zur psychologischen Forschungt to their characterization, recognition and decomposition. We also consider some basic properties of these classes. Further properties of the classes are studied in the following chapters of this book.作者: 紋章 時間: 2025-3-27 02:52 作者: 捐助 時間: 2025-3-27 06:45 作者: incarcerate 時間: 2025-3-27 12:33 作者: 寬容 時間: 2025-3-27 16:04
Landschaftsplanerische Perspektivenaphs is one of the most important areas in the theory of digraphs, and since several very interesting topics in this area have remained uncovered in the previous chapters, we discuss these topics in this chapter. We will mostly consider (directed) cycles; in most cases the adjective ‘directed’ is om作者: Tempor 時間: 2025-3-27 20:45 作者: PHON 時間: 2025-3-27 22:21 作者: Coeval 時間: 2025-3-28 05:21
J?rgen Bang-Jensen,Gregory GutinThis is the first book devoted to directed graphs.Includes applications and numerous examples.Includes many exercises.Includes supplementary material: 作者: collagen 時間: 2025-3-28 08:57 作者: bromide 時間: 2025-3-28 11:12
Soziale Interaktion — konzeptueller Rahmene consider bounds on certain distance parameters of a digraph and describe several results on minimizing (and maximizing) the diameter of an orientation of a graph. We study some applications of distances in digraphs to the travelling salesman problem, the one-way street problem and the gossip problem.作者: 圓木可阻礙 時間: 2025-3-28 17:33
Beitr?ge zur psychologischen Forschungt to their characterization, recognition and decomposition. We also consider some basic properties of these classes. Further properties of the classes are studied in the following chapters of this book.作者: OGLE 時間: 2025-3-28 20:49 作者: 階層 時間: 2025-3-29 00:20
Basic Terminology, Notation and Results,o better understand the notions introduced in the chapter. The results covered in this chapter constitute a collection of simple yet important facts on digraphs. Most of our terminology and notation are standard. Therefore, some readers may proceed to other chapters after a quick look through this c作者: arousal 時間: 2025-3-29 04:07 作者: Spangle 時間: 2025-3-29 07:25
Flows in Networks,ingle tool for applications of digraphs and perhaps even of graphs as a whole. At the same time, from a theoretical point of view, flow problems constitute a beautiful common generalization of shortest path problems and problems such as finding internally (arc)-disjoint paths from a given vertex to 作者: 混亂生活 時間: 2025-3-29 15:10 作者: enflame 時間: 2025-3-29 17:03
Global Connectivity,mulated as connectivity problems for digraphs and hence a significant part of this theory is also important from a practical point of view. Results on connectivity are often quite difficult and a deep insight may be required before one can obtain results in the area. The purpose of this chapter is t作者: jeopardize 時間: 2025-3-29 20:35 作者: 狂怒 時間: 2025-3-29 23:53
