找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 8073|回复: 48
发表于 2025-3-21 19:25:59 | 显示全部楼层 |阅读模式
书目名称Digraphs
副标题Theory, Algorithms a
编辑Jørgen Bang-Jensen,Gregory Gutin
视频video
概述This is the first book devoted to directed graphs.Includes applications and numerous examples.Includes many exercises.Includes supplementary material:
图书封面Titlebook: Digraphs; Theory, Algorithms a Jørgen Bang-Jensen,Gregory Gutin Book 20021st edition Springer-Verlag London 2002 Applications.Directed Grap
描述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 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 (digraphs). Even though both areas have numerous important applications, for various reasons, undirected graphs have been studied much more extensively than directed graphs. One of the reasons is that undirected graphs form in a sense a special class of directed graphs (symmetric digraphs) and hence problems that can be for­ mulated for both directed and undirected graphs are often easier for the latter. Another reason is that, unlike 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 elemen
出版日期Book 20021st edition
关键词Applications; Directed Graphs; Notation; Theory; algorithms; diagraphs; flows and connectivity; graph; graph
版次1
doihttps://doi.org/10.1007/978-1-4471-3886-0
isbn_ebook978-1-4471-3886-0
copyrightSpringer-Verlag London 2002
The information of publication is updating

书目名称Digraphs影响因子(影响力)




书目名称Digraphs影响因子(影响力)学科排名




书目名称Digraphs网络公开度




书目名称Digraphs网络公开度学科排名




书目名称Digraphs被引频次




书目名称Digraphs被引频次学科排名




书目名称Digraphs年度引用




书目名称Digraphs年度引用学科排名




书目名称Digraphs读者反馈




书目名称Digraphs读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:03:36 | 显示全部楼层
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
发表于 2025-3-22 03:25:28 | 显示全部楼层
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
发表于 2025-3-22 08:18:41 | 显示全部楼层
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:11 | 显示全部楼层
发表于 2025-3-22 13:43:00 | 显示全部楼层
发表于 2025-3-22 17:44:31 | 显示全部楼层
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.
发表于 2025-3-22 23:02:27 | 显示全部楼层
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
发表于 2025-3-23 02:37:44 | 显示全部楼层
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
发表于 2025-3-23 08:48:29 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-12 20:04
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表