找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: WALCOM: Algorithms and Computation; 13th International C Gautam K. Das,Partha S. Mandal,Shin-ichi Nakano Conference proceedings 2019 Spring

[复制链接]
查看: 42337|回复: 74
发表于 2025-3-21 19:59:11 | 显示全部楼层 |阅读模式
书目名称WALCOM: Algorithms and Computation
副标题13th International C
编辑Gautam K. Das,Partha S. Mandal,Shin-ichi Nakano
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: WALCOM: Algorithms and Computation; 13th International C Gautam K. Das,Partha S. Mandal,Shin-ichi Nakano Conference proceedings 2019 Spring
描述.This book constitutes the proceedings of the 13th International Conference and Workshop on Algorithms and Computation, WALCOM 2019, held in Guwahati, India, in February/ March 2019...The 30 full papers presented were carefully reviewed and selected from 100 submissions. The papers are organized in topical headings on the facility location problem; computational geometry; graph drawing; graph algorithms; approximation algorithms; miscellaneous; data structures; parallel and distributed algorithms; and packing and covering..
出版日期Conference proceedings 2019
关键词approximation algorithms; approximation algorithms analysis; cluster; clustering; computational geometry
版次1
doihttps://doi.org/10.1007/978-3-030-10564-8
isbn_softcover978-3-030-10563-1
isbn_ebook978-3-030-10564-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer Nature Switzerland AG 2019
The information of publication is updating

书目名称WALCOM: Algorithms and Computation影响因子(影响力)




书目名称WALCOM: Algorithms and Computation影响因子(影响力)学科排名




书目名称WALCOM: Algorithms and Computation网络公开度




书目名称WALCOM: Algorithms and Computation网络公开度学科排名




书目名称WALCOM: Algorithms and Computation被引频次




书目名称WALCOM: Algorithms and Computation被引频次学科排名




书目名称WALCOM: Algorithms and Computation年度引用




书目名称WALCOM: Algorithms and Computation年度引用学科排名




书目名称WALCOM: Algorithms and Computation读者反馈




书目名称WALCOM: Algorithms and Computation读者反馈学科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:27:36 | 显示全部楼层
发表于 2025-3-22 01:58:58 | 显示全部楼层
发表于 2025-3-22 05:10:40 | 显示全部楼层
发表于 2025-3-22 10:04:24 | 显示全部楼层
发表于 2025-3-22 14:32:54 | 显示全部楼层
发表于 2025-3-22 18:29:17 | 显示全部楼层
发表于 2025-3-22 21:12:38 | 显示全部楼层
Hard and Easy Instances of L-Tromino Tilingsegions where only . rotations of L-trominoes are available. For this particular case we show that deciding the existence of a tiling remains NP-complete; yet, if a region does not contain so-called “forbidden polyominoes” as subregions, then there exists a polynomial time algorithm for deciding a tiling.
发表于 2025-3-23 04:18:35 | 显示全部楼层
发表于 2025-3-23 06:39:55 | 显示全部楼层
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Componentssion for a class of graphs having a minimum resolving set with a bounded number of vertices in every extended biconnected component. Furthermore, we show that the decision problem . remains NP-complete when the above limitation is extended to usual biconnected components.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-30 10:58
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表