找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

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

打印 上一主題 下一主題

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

[復(fù)制鏈接]
查看: 8511|回復(fù): 48
樓主
發(fā)表于 2025-3-21 19:25:59 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Digraphs
副標(biāo)題Theory, Algorithms a
編輯J?rgen Bang-Jensen,Gregory Gutin
視頻videohttp://file.papertrans.cn/281/280433/280433.mp4
概述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
關(guān)鍵詞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影響因子(影響力)學(xué)科排名




書目名稱Digraphs網(wǎng)絡(luò)公開(kāi)度




書目名稱Digraphs網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書目名稱Digraphs被引頻次




書目名稱Digraphs被引頻次學(xué)科排名




書目名稱Digraphs年度引用




書目名稱Digraphs年度引用學(xué)科排名




書目名稱Digraphs讀者反饋




書目名稱Digraphs讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 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
板凳
發(fā)表于 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
地板
發(fā)表于 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
5#
發(fā)表于 2025-3-22 12:13:11 | 只看該作者
6#
發(fā)表于 2025-3-22 13:43:00 | 只看該作者
7#
發(fā)表于 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.
8#
發(fā)表于 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
9#
發(fā)表于 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
10#
發(fā)表于 2025-3-23 08:48:29 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-27 11:03
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
丹凤县| 胶南市| 教育| 榕江县| 吉木萨尔县| 崇义县| 平武县| 东港市| 丹巴县| 广饶县| 忻州市| 平度市| 孟津县| 沾益县| 汉阴县| 英吉沙县| 新宾| 独山县| 阿巴嘎旗| 罗田县| 叶城县| 吉林市| 罗甸县| 黑河市| 尼木县| 鹤山市| 阳城县| 连州市| 鄂温| 福建省| 南投市| 镇原县| 玉溪市| 富锦市| 呼玛县| 苗栗市| 香格里拉县| 巩义市| 瑞安市| 沅江市| 武平县|