用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: ;

[复制链接]
查看: 21391|回复: 63
发表于 2025-3-21 18:14:39 | 显示全部楼层 |阅读模式
书目名称Graph-Theoretic Concepts in Computer Science
编辑Dieter Kratsch
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: ;
出版日期Conference proceedings 20051st edition
版次1
doihttps://doi.org/10.1007/11604686
isbn_softcover978-3-540-31000-6
isbn_ebook978-3-540-31468-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
The information of publication is updating

书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)




书目名称Graph-Theoretic Concepts in Computer Science影响因子(影响力)学科排名




书目名称Graph-Theoretic Concepts in Computer Science网络公开度




书目名称Graph-Theoretic Concepts in Computer Science网络公开度学科排名




书目名称Graph-Theoretic Concepts in Computer Science被引频次




书目名称Graph-Theoretic Concepts in Computer Science被引频次学科排名




书目名称Graph-Theoretic Concepts in Computer Science年度引用




书目名称Graph-Theoretic Concepts in Computer Science年度引用学科排名




书目名称Graph-Theoretic Concepts in Computer Science读者反馈




书目名称Graph-Theoretic Concepts in Computer Science读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:23:09 | 显示全部楼层
发表于 2025-3-22 02:41:32 | 显示全部楼层
Computing the Tutte Polynomial on Graphs of Bounded Clique-Widththan that of tree-width. We show a subexponential algorithm (running in time exp.(..)) for computing the Tutte polynomial on cographs. The algorithm can be extended to a subexponential algorithm computing the Tutte polynomial on on all graphs of bounded clique-width. In fact, our algorithm computes the more general .-polynomial... 05C85, 68R10.
发表于 2025-3-22 06:23:15 | 显示全部楼层
发表于 2025-3-22 10:02:09 | 显示全部楼层
Fang Zhi-yang,Sheng Zhi-yong,Ge Sheng-ded into each other by a sequence of triangle mutations – or triangle switches. This construction generalizes Ringel’s theorem on uniform pseudoline arrangements. Moreover, it applies to plane projections of spatial graphs encoded by rank 4 uniform oriented matroids.
发表于 2025-3-22 14:16:25 | 显示全部楼层
Modern Trends in Fuzzy Graph Theoryt be .-hard. In this paper, we show that optimal broadcast domination is actually in ., and we give a polynomial time algorithm for solving the problem on arbitrary graphs, using a non standard approach.
发表于 2025-3-22 19:00:59 | 显示全部楼层
Complete Graph Drawings Up to Triangle Mutationsd into each other by a sequence of triangle mutations – or triangle switches. This construction generalizes Ringel’s theorem on uniform pseudoline arrangements. Moreover, it applies to plane projections of spatial graphs encoded by rank 4 uniform oriented matroids.
发表于 2025-3-22 22:30:28 | 显示全部楼层
发表于 2025-3-23 03:31:04 | 显示全部楼层
发表于 2025-3-23 08:58:50 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-7 00:38
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表