找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: CATBox; An Interactive Cours Winfried Hochstättler,Alexander Schliep Textbook 2010 Springer-Verlag Berlin Heidelberg 2010 Graph.Graph theor

[复制链接]
查看: 46218|回复: 44
发表于 2025-3-21 20:03:52 | 显示全部楼层 |阅读模式
书目名称CATBox
副标题An Interactive Cours
编辑Winfried Hochstättler,Alexander Schliep
视频video
概述Includes supplementary material:
图书封面Titlebook: CATBox; An Interactive Cours Winfried Hochstättler,Alexander Schliep Textbook 2010 Springer-Verlag Berlin Heidelberg 2010 Graph.Graph theor
描述.Graph algorithms are easy to visualize and indeed there already exists a variety of packages to animate the dynamics when solving problems from graph theory. Still it can be difficult to understand the ideas behind the algorithm from the dynamic display alone...CATBox consists of a software system for animating graph algorithms and a course book which we developed simultaneously. The software system presents both the algorithm and the graph and puts the user always in control of the actual code that is executed. In the course book, intended for readers at advanced undergraduate or graduate level, computer exercises and examples replace the usual static pictures of algorithm dynamics...For this volume we have chosen solely algorithms for classical problems from combinatorial optimization, such as minimum spanning trees, shortest paths, maximum flows, minimum cost flows, weighted and unweighted matchings both for bipartite and non-bipartite graphs...Find more information at http://schliep.org/CATBox/..
出版日期Textbook 2010
关键词Graph; Graph theory; Matching; Maxima; Sim; algorithms; combinatorial optimization; complexity; computer; dat
版次1
doihttps://doi.org/10.1007/978-3-642-03822-8
isbn_softcover978-3-540-14887-6
isbn_ebook978-3-642-03822-8
copyrightSpringer-Verlag Berlin Heidelberg 2010
The information of publication is updating

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




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




书目名称CATBox网络公开度




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




书目名称CATBox被引频次




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




书目名称CATBox年度引用




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




书目名称CATBox读者反馈




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




单选投票, 共有 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 22:08:50 | 显示全部楼层
发表于 2025-3-22 02:17:31 | 显示全部楼层
Linear Programming Duality,mming duality.The reader not interested in the more advanced algorithms of this book can feelfree to skip this chapter. The mathematics of this chapter is inevitable though, tofully appreciate the algorithms for mincost-flow and weighted matching.
发表于 2025-3-22 07:27:24 | 显示全部楼层
Maximal Flows,work at minimum cost. In more realistic problems from transportation we usually have to deal with capacity constraints, limiting the amount of flow across arcs. Hence, the basic problem in a capacitated network is to send as much flow as possible between two designated vertices, more precisely from
发表于 2025-3-22 11:31:01 | 显示全部楼层
Minimum-Cost Flows,an for period j as a shortest path. If we have capacities on the edges as well, the problem becomes a combination of a shortest path and a flow problem called a min-cost-flow-problem, which is the kind of problem we will discuss in this chapter. Compared to its simplest form, namely when we interpre
发表于 2025-3-22 13:45:47 | 显示全部楼层
Matching,t u and v are related. Take the assignment of students which share a room in a dormitory as an example. The students are our objects and the relation is .. The endpoints of any edge are roommates. If there are only double rooms in the dormitory, a pairing of roommates is a ..
发表于 2025-3-22 18:12:12 | 显示全部楼层
发表于 2025-3-22 21:24:16 | 显示全部楼层
,Organisationstheoretische Überlegungen,t the shortest path problem as the task to send one unit of flow from s to t at minimum cost, here, the problem becomes more complex. We may have an arbitrary number of supply and demand vertices, we call them sources and sinks, respectively.
发表于 2025-3-23 02:54:14 | 显示全部楼层
发表于 2025-3-23 07:00:08 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-5 07:58
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表