找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Algorithms; 26th International W Zsuzsanna Lipták,William F. Smyth Conference proceedings 2016 Springer International Publish

[复制链接]
查看: 25219|回复: 61
发表于 2025-3-21 19:56:04 | 显示全部楼层 |阅读模式
书目名称Combinatorial Algorithms
副标题26th International W
编辑Zsuzsanna Lipták,William F. Smyth
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Combinatorial Algorithms; 26th International W Zsuzsanna Lipták,William F. Smyth Conference proceedings 2016 Springer International Publish
描述.This book constitutes the thoroughly refereedpost-workshop proceedings for the 26 International Workshop on combinatorialAlgorithms, IWOCA 2015, held in Verona, Italy, in October 2015..The 29 revised full papers presented were carefullyreviewed and selected from a total of 90 submissions. The topics of the papersinclude algorithms and data structures (including sequential, parallel,distributed, approximation, probabilistic, randomised, and on-line algorithms),algorithms on strings and graphs; applications (bioinformatics, music analysis,networking, and others); combinatorics on words; combinatorial enumeration;combinatorial optimization; complexity theory; computational biology;compression and information retrieval; cryptography and information security;decompositions and combinatorial designs; discrete and computational geometry;graph drawing and labeling; graph theory... .
出版日期Conference proceedings 2016
关键词approximation algorithms; combinatorics; data structures; distributed algorithms; graph theory; algorithm
版次1
doihttps://doi.org/10.1007/978-3-319-29516-9
isbn_softcover978-3-319-29515-2
isbn_ebook978-3-319-29516-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer International Publishing Switzerland 2016
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

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-22 00:03:24 | 显示全部楼层
发表于 2025-3-22 02:59:55 | 显示全部楼层
发表于 2025-3-22 07:01:42 | 显示全部楼层
发表于 2025-3-22 08:57:43 | 显示全部楼层
Dmitrii S. Dudin,Ilya E. Kelleroperties. We show that the Full-Flag Johnson graphs are Cayley graphs on . generated by certain well-known classes of permutations and that they are in fact generalizations of permutahedra. Our main result will be to establish a tight . bound for the diameter of the Full-Flag Johnson graph .(., .).
发表于 2025-3-22 15:47:36 | 显示全部楼层
Combinatorial Properties of Full-Flag Johnson Graphs,operties. We show that the Full-Flag Johnson graphs are Cayley graphs on . generated by certain well-known classes of permutations and that they are in fact generalizations of permutahedra. Our main result will be to establish a tight . bound for the diameter of the Full-Flag Johnson graph .(., .).
发表于 2025-3-22 17:57:52 | 显示全部楼层
Conference proceedings 2016 in Verona, Italy, in October 2015..The 29 revised full papers presented were carefullyreviewed and selected from a total of 90 submissions. The topics of the papersinclude algorithms and data structures (including sequential, parallel,distributed, approximation, probabilistic, randomised, and on-li
发表于 2025-3-22 21:24:26 | 显示全部楼层
Conference proceedings 2016torial enumeration;combinatorial optimization; complexity theory; computational biology;compression and information retrieval; cryptography and information security;decompositions and combinatorial designs; discrete and computational geometry;graph drawing and labeling; graph theory... .
发表于 2025-3-23 03:02:55 | 显示全部楼层
发表于 2025-3-23 05:36:24 | 显示全部楼层
https://doi.org/10.1007/978-1-349-27750-6al word, i.e., the longest substrings starting at . and . that are .. We show that our results match with those of total words (partial words without holes). We find that one of the simplest algorithms for implementing the LCE problem is optimal on average in this case.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-6 07:05
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表