找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Classes of Directed Graphs; Jørgen Bang-Jensen,Gregory Gutin Book 2018 Springer International Publishing AG, part of Springer Nature 2018

[复制链接]
查看: 41412|回复: 46
发表于 2025-3-21 16:56:26 | 显示全部楼层 |阅读模式
书目名称Classes of Directed Graphs
编辑Jørgen Bang-Jensen,Gregory Gutin
视频video
概述Presents the latest research in the subject area, including significant new results obtained over recent years.Illustrates various approaches, techniques and algorithms used in digraph theory.Explores
丛书名称Springer Monographs in Mathematics
图书封面Titlebook: Classes of Directed Graphs;  Jørgen Bang-Jensen,Gregory Gutin Book 2018 Springer International Publishing AG, part of Springer Nature 2018
描述.This edited volume offers a detailed account of the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic...Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field. It covers core new results on each of the classes discussed, including chapters on tournaments, planar digraphs, acyclic digraphs, Euler digraphs, graph products, directed width parameters, and algorithms. Detailed indices ease navigation while more than 120 open problems and conjectures ensure that readers are immersed in all aspects of the field...Classes of Directed Graphs. provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc..
出版日期Book 2018
关键词directed graphs; directed graphs classes; tournaments generalizations; planar digraphs; acyclic digraphs
版次1
doihttps://doi.org/10.1007/978-3-319-71840-8
isbn_softcover978-3-030-10122-0
isbn_ebook978-3-319-71840-8Series ISSN 1439-7382 Series E-ISSN 2196-9922
issn_series 1439-7382
copyrightSpringer International Publishing AG, part of Springer Nature 2018
The information of publication is updating

书目名称Classes of Directed Graphs影响因子(影响力)




书目名称Classes of Directed Graphs影响因子(影响力)学科排名




书目名称Classes of Directed Graphs网络公开度




书目名称Classes of Directed Graphs网络公开度学科排名




书目名称Classes of Directed Graphs被引频次




书目名称Classes of Directed Graphs被引频次学科排名




书目名称Classes of Directed Graphs年度引用




书目名称Classes of Directed Graphs年度引用学科排名




书目名称Classes of Directed Graphs读者反馈




书目名称Classes of Directed Graphs读者反馈学科排名




单选投票, 共有 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 20:57:49 | 显示全部楼层
Programmentscheidungen (Lerneinheit VII),ious important proof-techniques. Several of the results hold even for some superclasses of locally semicomplete digraphs. Many of the proofs and algorithms rely on a structural characterization of those locally semicomplete digraphs that are not semicomplete (have independence number at least 2). As
发表于 2025-3-22 03:46:35 | 显示全部楼层
https://doi.org/10.1007/978-3-8349-6316-1. to be .-quasi-transitive if for any pair of vertices ., . in ., the existence of a path of length . from . to . implies that ., . or both are arcs of .. Given a class of digraphs ., we say that a digraph is totally .-decomposable if it can be expressed as a composition of totally .-decomposable di
发表于 2025-3-22 05:43:37 | 显示全部楼层
https://doi.org/10.1007/978-3-8349-6316-1gue of tree-width measure global connectivity in digraphs. However, on digraphs, connectivity can be measured in many different natural ways. It turns out that equivalent characterizations of tree-width on undirected graphs yield different concepts on digraphs, with different properties, advantages
发表于 2025-3-22 10:35:30 | 显示全部楼层
https://doi.org/10.1007/978-3-8349-3824-4t digraphs which are mentioned in several results throughout the book and appear in this chapter in a section mainly dedicated to perfect digraphs, game-perfect digraphs and weakly game-perfect digraphs. Furthermore, we consider some digraph classes that appear naturally in applications to other fie
发表于 2025-3-22 16:17:14 | 显示全部楼层
Locally Semicomplete Digraphs and Generalizations,ious important proof-techniques. Several of the results hold even for some superclasses of locally semicomplete digraphs. Many of the proofs and algorithms rely on a structural characterization of those locally semicomplete digraphs that are not semicomplete (have independence number at least 2). As
发表于 2025-3-22 20:46:08 | 显示全部楼层
Quasi-Transitive Digraphs and Their Extensions,. to be .-quasi-transitive if for any pair of vertices ., . in ., the existence of a path of length . from . to . implies that ., . or both are arcs of .. Given a class of digraphs ., we say that a digraph is totally .-decomposable if it can be expressed as a composition of totally .-decomposable di
发表于 2025-3-23 00:54:19 | 显示全部楼层
发表于 2025-3-23 04:26:11 | 显示全部楼层
Miscellaneous Digraph Classes,t digraphs which are mentioned in several results throughout the book and appear in this chapter in a section mainly dedicated to perfect digraphs, game-perfect digraphs and weakly game-perfect digraphs. Furthermore, we consider some digraph classes that appear naturally in applications to other fie
发表于 2025-3-23 09:09:49 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 23:28
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表