找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Digraphs; Theory, Algorithms a J?rgen Bang-Jensen,Gregory Gutin Book 20021st edition Springer-Verlag London 2002 Applications.Directed Grap

[復(fù)制鏈接]
樓主: retort
11#
發(fā)表于 2025-3-23 11:29:11 | 只看該作者
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.
12#
發(fā)表于 2025-3-23 14:11:55 | 只看該作者
13#
發(fā)表于 2025-3-23 18:10:38 | 只看該作者
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.
14#
發(fā)表于 2025-3-24 00:36:26 | 只看該作者
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.
15#
發(fā)表于 2025-3-24 04:18:57 | 只看該作者
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.
16#
發(fā)表于 2025-3-24 10:11:37 | 只看該作者
17#
發(fā)表于 2025-3-24 11:46:06 | 只看該作者
18#
發(fā)表于 2025-3-24 16:37:46 | 只看該作者
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.
19#
發(fā)表于 2025-3-24 22:22:22 | 只看該作者
20#
發(fā)表于 2025-3-25 00:54:57 | 只看該作者
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.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-27 18:34
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
库尔勒市| 星子县| 东乌珠穆沁旗| 五华县| 石狮市| 亚东县| 刚察县| 威海市| 浑源县| 富源县| 乳山市| 临泽县| 阆中市| 榆社县| 宝鸡市| 兴山县| 同仁县| 张家港市| 石嘴山市| 县级市| 广丰县| 澳门| 舒城县| 绥中县| 乐清市| 江口县| 专栏| 邳州市| 宝丰县| 宁化县| 泰宁县| 搜索| 壶关县| 驻马店市| 射洪县| 都兰县| 沧源| 辽中县| 德钦县| 新和县| 武清区|