找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: ;

[复制链接]
查看: 38703|回复: 62
发表于 2025-3-21 19:51:54 | 显示全部楼层 |阅读模式
书目名称Graph-Theoretic Concepts in Computer Science
编辑Pinar Heggernes
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: ;
出版日期Conference proceedings 2016
版次1
doihttps://doi.org/10.1007/978-3-662-53536-3
isbn_softcover978-3-662-53535-6
isbn_ebook978-3-662-53536-3Series 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

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:27:30 | 显示全部楼层
The Maximum Weight Stable Set Problem in (,, bull)-Free Graphs,We present a polynomial-time algorithm that finds a maximum weight stable set in a graph that does not contain as an induced subgraph an induced path on six vertices or a bull (the graph with vertices ., ., ., ., . and edges ., ., ., ., .).
发表于 2025-3-22 00:30:41 | 显示全部楼层
Graph-Theoretic Concepts in Computer Science978-3-662-53536-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-22 04:36:21 | 显示全部楼层
发表于 2025-3-22 12:01:32 | 显示全部楼层
Approximate Association via Dissociation,or a single edge. Interestingly, . is then precisely a graph containing no induced .’s or containing no .’s, respectively. We observe some special structures and show that if none of them exists, then the minimum association set problem can be reduced to the minimum (weighted) dissociation set probl
发表于 2025-3-22 14:12:20 | 显示全部楼层
Geodetic Convexity Parameters for Graphs with Few Short Induced Paths,tion posed by Araujo et al., we show that computing the geodetic hull number of a given .-free graph is NP-hard. Similarly, we show that computing the geodetic interval number of a given .-free graph is NP-hard. On the positive side, we identify several graph classes for which the geodetic hull numb
发表于 2025-3-22 17:10:47 | 显示全部楼层
发表于 2025-3-22 23:26:10 | 显示全部楼层
Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results, Here, we tackle this problem under the framework of parameterized complexity. In particular, we first show to what extend the result of [.] - saving colors from the trivial bound of . on the chromatic number - extends to Max Coloring. Then we consider possible improvements of these results by consi
发表于 2025-3-23 02:13:31 | 显示全部楼层
Finding Two Edge-Disjoint Paths with Length Constraints,dges and the length of each . satisfies ., where .. We regard . and . as parameters and investigate the parameterized complexity of the above problem when at least one of . and . has a length constraint (note that .” indicates that . has no length constraint). For the nine different cases of ., we o
发表于 2025-3-23 07:24:19 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-21 20:59
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表