找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Algorithms; 32nd International W Paola Flocchini,Lucia Moura Conference proceedings 2021 Springer Nature Switzerland AG 2021

[复制链接]
查看: 26180|回复: 56
发表于 2025-3-21 19:53:29 | 显示全部楼层 |阅读模式
书目名称Combinatorial Algorithms
副标题32nd International W
编辑Paola Flocchini,Lucia Moura
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Combinatorial Algorithms; 32nd International W Paola Flocchini,Lucia Moura Conference proceedings 2021 Springer Nature Switzerland AG 2021
描述This book constitutes the proceedings of the 32nd International Workshop on Combinatorial Algorithms which was planned to take place in Ottawa, ON, Canada, in July 2021. Due to the COVID-19 pandemic the conference changed to a virtual format..The 38 full papers included in this book together with 2 invited talks were carefully reviewed and selected from 107 submissions. They focus on algorithms design for the myriad of combinatorial problems that underlie computer applications in science, engineering and business..Chapter “Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com..
出版日期Conference proceedings 2021
关键词approximation algorithms; artificial intelligence; bipartite graphs; combinatorial algorithms; combinato
版次1
doihttps://doi.org/10.1007/978-3-030-79987-8
isbn_softcover978-3-030-79986-1
isbn_ebook978-3-030-79987-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer Nature Switzerland AG 2021
The information of publication is updating

书目名称Combinatorial Algorithms影响因子(影响力)




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




书目名称Combinatorial Algorithms网络公开度




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




书目名称Combinatorial Algorithms被引频次




书目名称Combinatorial Algorithms被引频次学科排名




书目名称Combinatorial Algorithms年度引用




书目名称Combinatorial Algorithms年度引用学科排名




书目名称Combinatorial Algorithms读者反馈




书目名称Combinatorial Algorithms读者反馈学科排名




单选投票, 共有 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:42:11 | 显示全部楼层
发表于 2025-3-22 02:39:00 | 显示全部楼层
发表于 2025-3-22 06:02:40 | 显示全部楼层
发表于 2025-3-22 10:34:55 | 显示全部楼层
发表于 2025-3-22 15:16:46 | 显示全部楼层
Search for Combinatorial Objects Using Lattice Algorithms – Revisitedrithms in combinatorial search is still not well established. Here, we provide a list of problems which could be tackled with this approach and give an overview on exhaustive search using lattice basis reduction. Finally, we describe a different enumeration strategy which might improve the power of this method even further.
发表于 2025-3-22 17:13:03 | 显示全部楼层
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphss called the conflict-free chromatic number. The decision version of the CFON* problem is NP-complete even on planar graphs..In this paper, we show the following results..We also study the closed neighborhood variant of the problem denoted by CFCN*, and obtain analogous results in some of the above cases.
发表于 2025-3-22 21:14:07 | 显示全部楼层
Linear Algorithms for Red and Blue Domination in Convex Bipartite Graphsalgorithm presented is faster and simpler than that in the literature. Due to the asymmetry in convex bipartite graphs, the algorithm does not extend to . blue domination. We present a linear time algorithm to solve the minimum cardinality blue domination problem for convex bipartite graphs.
发表于 2025-3-23 04:30:15 | 显示全部楼层
发表于 2025-3-23 06:44:10 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 11:31
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表