找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Algorithms; 30th International W Charles J. Colbourn,Roberto Grossi,Nadia Pisanti Conference proceedings 2019 Springer Nature

[复制链接]
查看: 35452|回复: 65
发表于 2025-3-21 19:36:16 | 显示全部楼层 |阅读模式
书目名称Combinatorial Algorithms
副标题30th International W
编辑Charles J. Colbourn,Roberto Grossi,Nadia Pisanti
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Combinatorial Algorithms; 30th International W Charles J. Colbourn,Roberto Grossi,Nadia Pisanti Conference proceedings 2019 Springer Nature
描述.This book constitutes the refereed post-conference proceedings of the 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, held in Pisa, Italy, in July 2019. The 36 regular papers presented in this volume were carefully reviewed and selected from 73 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomized algorithms, algorithms for big data analytics, and new paradigms of computation..
出版日期Conference proceedings 2019
关键词approximation algorithms; artificial intelligence; bipartite graphs; combinatorial algorithms; combinato
版次1
doihttps://doi.org/10.1007/978-3-030-25005-8
isbn_softcover978-3-030-25004-1
isbn_ebook978-3-030-25005-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer Nature Switzerland AG 2019
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 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:54:53 | 显示全部楼层
发表于 2025-3-22 04:01:08 | 显示全部楼层
发表于 2025-3-22 04:40:16 | 显示全部楼层
,On Erdős–Szekeres-Type Problems for ,-convex Point Sets,inite set . of . points is . if there exists a spanning simple polygonization of . such that the intersection of any straight line with its interior consists of at most . connected components. We address several open problems about .-convex point sets. In particular, we extend the well-known Erdős–S
发表于 2025-3-22 09:30:37 | 显示全部楼层
发表于 2025-3-22 13:36:47 | 显示全部楼层
Fixed-Parameter Tractability of , List Coloring,aph and the goal is to color the vertices of the graph with minimum number of colors so that end points of each edge gets different colors. In list-coloring, each vertex is given a list of allowed colors with which it can be colored..In parameterized complexity, the goal is to identify natural param
发表于 2025-3-22 19:34:37 | 显示全部楼层
发表于 2025-3-22 23:55:42 | 显示全部楼层
发表于 2025-3-23 04:06:39 | 显示全部楼层
Solving Group Interval Scheduling Efficiently,g in exactly one time interval from a group . of allowed intervals. The objective is to determine if there is a set of . of . jobs which can be scheduled in non-overlapping time intervals..This work describes a deterministic algorithm for the problem that runs in time ., where . and . is a constant.
发表于 2025-3-23 05:35:47 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-5 14:22
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表