找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computational Graph Theory; G. Tinhofer,E. Mayr,M. M. Syslo Book 1990 Springer-Verlag/Wien 1990 Layout.algorithms.calculus.computational g

[复制链接]
查看: 20311|回复: 51
发表于 2025-3-21 20:06:33 | 显示全部楼层 |阅读模式
书目名称Computational Graph Theory
编辑G. Tinhofer,E. Mayr,M. M. Syslo
视频video
丛书名称Computing Supplementa
图书封面Titlebook: Computational Graph Theory;  G. Tinhofer,E. Mayr,M. M. Syslo Book 1990 Springer-Verlag/Wien 1990 Layout.algorithms.calculus.computational g
描述One ofthe most important aspects in research fields where mathematics is "applied is the construction of a formal model of a real system. As for structural relations, graphs have turned out to provide the most appropriate tool for setting up the mathematical model. This is certainly one of the reasons for the rapid expansion in graph theory during the last decades. Furthermore, in recent years it also became clear that the two disciplines of graph theory and computer science have very much in common, and that each one has been capable of assisting significantly in the development of the other. On one hand, graph theorists have found that many of their problems can be solved by the use of com­ puting techniques, and on the other hand, computer scientists have realized that many of their concepts, with which they have to deal, may be conveniently expressed in the lan­ guage of graph theory, and that standard results in graph theory are often very relevant to the solution of problems concerning them. As a consequence, a tremendous number of publications has appeared, dealing with graphtheoretical problems from a computational point of view or treating computational problems using grap
出版日期Book 1990
关键词Layout; algorithms; calculus; computational graph theory; graph theory; graphs; network; combinatorics
版次1
doihttps://doi.org/10.1007/978-3-7091-9076-0
isbn_softcover978-3-211-82177-0
isbn_ebook978-3-7091-9076-0Series ISSN 0344-8029
issn_series 0344-8029
copyrightSpringer-Verlag/Wien 1990
The information of publication is updating

书目名称Computational Graph Theory影响因子(影响力)




书目名称Computational Graph Theory影响因子(影响力)学科排名




书目名称Computational Graph Theory网络公开度




书目名称Computational Graph Theory网络公开度学科排名




书目名称Computational Graph Theory被引频次




书目名称Computational Graph Theory被引频次学科排名




书目名称Computational Graph Theory年度引用




书目名称Computational Graph Theory年度引用学科排名




书目名称Computational Graph Theory读者反馈




书目名称Computational Graph Theory读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:14:01 | 显示全部楼层
Jitka Dupačová,Jan Hurt,Josef Štěpánarrays, and Weinberger arrays. These include a variety of mostly independently investigated graph problems such as augmentation of a given graph to an interval graph with small clique size, node search of graphs, matching problems with side constraints, and other. We discuss implications of graph th
发表于 2025-3-22 02:11:21 | 显示全部楼层
Stochastic Modeling in Economics and Financeanarity testing, embedding, drawing, separators, vertex-coloring, independent vertex set, listing subgraphs, Hamiltonian cycle, network flows, and Steiner trees and forests. Also typical methods and techniques useful for computational problems on planar graphs are discussed. Furthermore open questio
发表于 2025-3-22 04:38:13 | 显示全部楼层
发表于 2025-3-22 11:48:13 | 显示全部楼层
Kazimierz Sobczyk,David J. Kirkneralgorithm to find transitive orientations of graphs where they exist. Both algorithms together solve the maximum clique problem and the minimum coloring problem for comparability graphs, and the maximum matching problem for co-comparability graphs. The transitive orientation algorithm can also be us
发表于 2025-3-22 14:33:19 | 显示全部楼层
发表于 2025-3-22 19:22:14 | 显示全部楼层
Stochastic Modelling and Filteringmes that the problem instances are randomly selected from some reasonable distribution of problems. We consider two types of problem. The first sort is polynomially solvable in the worst case but there are algorithms with better average case performance. In particular we consider the all-pairs short
发表于 2025-3-22 22:17:29 | 显示全部楼层
发表于 2025-3-23 04:42:40 | 显示全部楼层
V. I. Klyatskin,W. A. Woyczynski,D. Gurariectures. Such embeddings can be viewed as high level descriptions of efficient methods to simulate an algorithm designed for one type of parallel machine on a different network structure and/or techniques to distribute data/program variables to achieve optimum use of all available processors...: 68Q1
发表于 2025-3-23 06:25:22 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-4 13:19
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表