omnibus
发表于 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.
Cholagogue
发表于 2025-3-23 14:11:55
http://reply.papertrans.cn/29/2805/280433/280433_12.png
诱骗
发表于 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.
collateral
发表于 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.
FUSE
发表于 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.
dithiolethione
发表于 2025-3-24 10:11:37
http://reply.papertrans.cn/29/2805/280433/280433_16.png
covert
发表于 2025-3-24 11:46:06
http://reply.papertrans.cn/29/2805/280433/280433_17.png
nautical
发表于 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.
declamation
发表于 2025-3-24 22:22:22
http://reply.papertrans.cn/29/2805/280433/280433_19.png
多嘴多舌
发表于 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.