標(biāo)題: Titlebook: Classes of Directed Graphs; J?rgen Bang-Jensen,Gregory Gutin Book 2018 Springer International Publishing AG, part of Springer Nature 2018 [打印本頁] 作者: counterfeit 時(shí)間: 2025-3-21 16:56
書目名稱Classes of Directed Graphs影響因子(影響力)
書目名稱Classes of Directed Graphs影響因子(影響力)學(xué)科排名
書目名稱Classes of Directed Graphs網(wǎng)絡(luò)公開度
書目名稱Classes of Directed Graphs網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Classes of Directed Graphs被引頻次
書目名稱Classes of Directed Graphs被引頻次學(xué)科排名
書目名稱Classes of Directed Graphs年度引用
書目名稱Classes of Directed Graphs年度引用學(xué)科排名
書目名稱Classes of Directed Graphs讀者反饋
書目名稱Classes of Directed Graphs讀者反饋學(xué)科排名
作者: debouch 時(shí)間: 2025-3-21 20:57
Programmentscheidungen (Lerneinheit VII),ious important proof-techniques. Several of the results hold even for some superclasses of locally semicomplete digraphs. Many of the proofs and algorithms rely on a structural characterization of those locally semicomplete digraphs that are not semicomplete (have independence number at least 2). As作者: CHYME 時(shí)間: 2025-3-22 03:46
https://doi.org/10.1007/978-3-8349-6316-1. to be .-quasi-transitive if for any pair of vertices .,?. in ., the existence of a path of length . from . to . implies that ., . or both are arcs of .. Given a class of digraphs ., we say that a digraph is totally .-decomposable if it can be expressed as a composition of totally .-decomposable di作者: SKIFF 時(shí)間: 2025-3-22 05:43
https://doi.org/10.1007/978-3-8349-6316-1gue of tree-width measure global connectivity in digraphs. However, on digraphs, connectivity can be measured in many different natural ways. It turns out that equivalent characterizations of tree-width on undirected graphs yield different concepts on digraphs, with different properties, advantages 作者: Rebate 時(shí)間: 2025-3-22 10:35
https://doi.org/10.1007/978-3-8349-3824-4t digraphs which are mentioned in several results throughout the book and appear in this chapter in a section mainly dedicated to perfect digraphs, game-perfect digraphs and weakly game-perfect digraphs. Furthermore, we consider some digraph classes that appear naturally in applications to other fie作者: 增減字母法 時(shí)間: 2025-3-22 16:17
Locally Semicomplete Digraphs and Generalizations,ious important proof-techniques. Several of the results hold even for some superclasses of locally semicomplete digraphs. Many of the proofs and algorithms rely on a structural characterization of those locally semicomplete digraphs that are not semicomplete (have independence number at least 2). As作者: 增減字母法 時(shí)間: 2025-3-22 20:46
Quasi-Transitive Digraphs and Their Extensions,. to be .-quasi-transitive if for any pair of vertices .,?. in ., the existence of a path of length . from . to . implies that ., . or both are arcs of .. Given a class of digraphs ., we say that a digraph is totally .-decomposable if it can be expressed as a composition of totally .-decomposable di作者: 愛哭 時(shí)間: 2025-3-23 00:54 作者: 受人支配 時(shí)間: 2025-3-23 04:26
Miscellaneous Digraph Classes,t digraphs which are mentioned in several results throughout the book and appear in this chapter in a section mainly dedicated to perfect digraphs, game-perfect digraphs and weakly game-perfect digraphs. Furthermore, we consider some digraph classes that appear naturally in applications to other fie作者: 頂點(diǎn) 時(shí)間: 2025-3-23 09:09 作者: 詞匯 時(shí)間: 2025-3-23 13:41 作者: Insulin 時(shí)間: 2025-3-23 14:02 作者: Ablation 時(shí)間: 2025-3-23 20:11 作者: Charade 時(shí)間: 2025-3-24 01:29
978-3-030-10122-0Springer International Publishing AG, part of Springer Nature 2018作者: BAIT 時(shí)間: 2025-3-24 02:29
https://doi.org/10.1007/978-3-8349-3824-4This chapter is a survey of the four standard associative digraph products, namely the Cartesian, strong, direct and lexicographic products. Topics include metric properties, connectedness, hamiltonian properties and invariants. Special attention is given to issues of cancellation and unique prime factorization.作者: overrule 時(shí)間: 2025-3-24 09:07
Digraphs Products,This chapter is a survey of the four standard associative digraph products, namely the Cartesian, strong, direct and lexicographic products. Topics include metric properties, connectedness, hamiltonian properties and invariants. Special attention is given to issues of cancellation and unique prime factorization.作者: 懸掛 時(shí)間: 2025-3-24 11:24
Basic Terminology, Notation and Results,o better understand the notions introduced in the chapter. We also prove some basic results on digraphs and provide some fundamental digraph results without proofs. Most of our terminology and notation is standard and agrees with (Bang-Jensen, Gutin, Digraphs: theory, algorithms and applications. Springer, London, 2009, [.]).作者: observatory 時(shí)間: 2025-3-24 17:29
Planar Digraphs,crossings. The main goal of this chapter is to show, from multiple angles, how the planarity assumption imposes structure on digraphs and how such structure, in conjunction with topological arguments, can be used algorithmically.作者: Sarcoma 時(shí)間: 2025-3-24 22:54
J?rgen Bang-Jensen,Gregory GutinPresents the latest research in the subject area, including significant new results obtained over recent years.Illustrates various approaches, techniques and algorithms used in digraph theory.Explores作者: Gourmet 時(shí)間: 2025-3-24 23:27
Springer Monographs in Mathematicshttp://image.papertrans.cn/c/image/227023.jpg作者: detach 時(shí)間: 2025-3-25 04:40 作者: 黑豹 時(shí)間: 2025-3-25 08:42 作者: 有害處 時(shí)間: 2025-3-25 13:36 作者: 自愛 時(shí)間: 2025-3-25 18:34 作者: Airtight 時(shí)間: 2025-3-25 22:14 作者: Emasculate 時(shí)間: 2025-3-26 02:33
Programmentscheidungen (Lerneinheit VII),emicomplete digraphs with a very rich structure. The class contains digraphs, such as directed cycles, that are very far from being semicomplete. Yet a large number of classical results for semicomplete digraphs still hold for locally semicomplete digraphs. Two examples are that every connected loca作者: VEST 時(shí)間: 2025-3-26 04:36
Repetitorium zur Investitionsrechnunga complete multipartite graph by replacing every edge by an arc or a pair of opposite arcs. In other words, the vertex set of a semicomplete multipartite digraph can be partitioned into sets such that vertices within the same set are nonadjacent and vertices between different sets are adjacent. This作者: Hiatus 時(shí)間: 2025-3-26 10:37
https://doi.org/10.1007/978-3-8349-6316-1arcs of .. Quasi-transitive digraphs generalize both tournaments (and semicomplete digraphs) and transitive digraphs, and share some of the nice properties of these families. In particular, many problems that are .-complete for general digraphs become solvable in polynomial time when restricted to q作者: CANT 時(shí)間: 2025-3-26 15:56
https://doi.org/10.1007/978-3-8349-6316-1on the minor relation and they have also found many algorithmic applications. Starting in the late 1990s, several ideas for generalizing this theory to digraphs have appeared. Broadly, for the purpose of this chapter, we distinguish these approaches into three categories: ., . and .. The tree-width 作者: Isthmus 時(shí)間: 2025-3-26 17:50 作者: 要塞 時(shí)間: 2025-3-26 22:16 作者: Restenosis 時(shí)間: 2025-3-27 03:02 作者: AMEND 時(shí)間: 2025-3-27 07:52 作者: aquatic 時(shí)間: 2025-3-27 11:59
Acyclic Digraphs,pplications. We consider some basic results on acyclic digraphs and introduce transitive digraphs, and the transitive closure and transitive reduction of a digraph. We discuss results on out- and in-branchings, the .-linkage problem, maximum dicuts, and the multicut problem. We present enumeration r作者: 不適當(dāng) 時(shí)間: 2025-3-27 16:25 作者: Fecal-Impaction 時(shí)間: 2025-3-27 19:44
Planar Digraphs,crossings. The main goal of this chapter is to show, from multiple angles, how the planarity assumption imposes structure on digraphs and how such structure, in conjunction with topological arguments, can be used algorithmically.作者: Suppository 時(shí)間: 2025-3-28 01:27 作者: 積習(xí)已深 時(shí)間: 2025-3-28 05:06
Semicomplete Multipartite Digraphs,a complete multipartite graph by replacing every edge by an arc or a pair of opposite arcs. In other words, the vertex set of a semicomplete multipartite digraph can be partitioned into sets such that vertices within the same set are nonadjacent and vertices between different sets are adjacent. This作者: entail 時(shí)間: 2025-3-28 08:37
Quasi-Transitive Digraphs and Their Extensions,arcs of .. Quasi-transitive digraphs generalize both tournaments (and semicomplete digraphs) and transitive digraphs, and share some of the nice properties of these families. In particular, many problems that are .-complete for general digraphs become solvable in polynomial time when restricted to q作者: fledged 時(shí)間: 2025-3-28 14:09 作者: PANEL 時(shí)間: 2025-3-28 14:46
Miscellaneous Digraph Classes, selection. This chapter tries to survey some of the digraph classes that were not granted their own chapter in this book. As tournaments are arguably the best studied class of digraphs with a rich library of strong results, it is no wonder that they and their many generalizations are featured promi作者: RAFF 時(shí)間: 2025-3-28 22:19
Lexicographic Orientation Algorithms,damental problems asks whether a given graph admits an orientation that satisfies a prescribed property and to find such an orientation if it exists. In this chapter, we demonstrate a very simple orientation technique known as the lexicographic orientation method. We show how this method can be appl作者: MELD 時(shí)間: 2025-3-29 00:04 作者: 魯莽 時(shí)間: 2025-3-29 05:13
Repetitorium zur Investitionsrechnungesults for acyclic digraphs, and results on maximum spanning and induced subgraphs of digraphs. Four sections are devoted to applications of acyclic digraphs: in embedded computing, cryptographic enforcement schemes, project schedulting, and text analysing. The final section is on acyclic edge-coloured graphs which generalize acyclic digraphs.作者: 珊瑚 時(shí)間: 2025-3-29 07:48 作者: Commemorate 時(shí)間: 2025-3-29 14:49 作者: 非秘密 時(shí)間: 2025-3-29 18:00
