找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: retort
发表于 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.
发表于 2025-3-23 14:11:55 | 显示全部楼层
发表于 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.
发表于 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.
发表于 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.
发表于 2025-3-24 10:11:37 | 显示全部楼层
发表于 2025-3-24 11:46:06 | 显示全部楼层
发表于 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.
发表于 2025-3-24 22:22:22 | 显示全部楼层
发表于 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.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-12 20:12
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表