设为首页收藏本站
开启辅助访问 切换到窄版

 找回密码
 To register

QQ登录

只需一步，快速开始

扫一扫，访问微社区

  • ALL
  • Journals
  • Books

派博传思国际中心 »期刊书目

› BOOKS
› BOOKS with Alphabet L (La, Lb,Lc, Ld, Le…... )

1234567下一页
返回列表

Titlebook: LATIN 2018: Theoretical Informatics; 13th Latin American Michael A. Bender,Martín Farach-Colton,Miguel A. M Conference proceedings 2018 Sp

[复制链接]
查看: 24333|回复: 62
发表于 2025-3-21 18:21:39 | 显示全部楼层 |阅读模式
书目名称LATIN 2018: Theoretical Informatics
副标题13th Latin American
编辑Michael A. Bender,Martín Farach-Colton,Miguel A. M
视频videohttp://file.papertrans.cn/581/580047/580047.mp4
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: LATIN 2018: Theoretical Informatics; 13th Latin American Michael A. Bender,Martín Farach-Colton,Miguel A. M Conference proceedings 2018 Sp
描述This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018. The 63 papers presented in this volume were carefully reviewed and selected from 161 submissions. The Symposium is devoted to different areas in theoretical computer science, including, but not limited to: algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures..
出版日期Conference proceedings 2018
关键词ad hoc networks; approximation algorithms; artificial intelligence; coloring; graph theory; graphic metho
版次1
doihttps://doi.org/10.1007/978-3-319-77404-6
isbn_softcover978-3-319-77403-9
isbn_ebook978-3-319-77404-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer International Publishing AG, part of Springer Nature 2018
The information of publication is updating

书目名称LATIN 2018: Theoretical Informatics影响因子(影响力)




书目名称LATIN 2018: Theoretical Informatics影响因子(影响力)学科排名




书目名称LATIN 2018: Theoretical Informatics网络公开度




书目名称LATIN 2018: Theoretical Informatics网络公开度学科排名




书目名称LATIN 2018: Theoretical Informatics被引频次




书目名称LATIN 2018: Theoretical Informatics被引频次学科排名




书目名称LATIN 2018: Theoretical Informatics年度引用




书目名称LATIN 2018: Theoretical Informatics年度引用学科排名




书目名称LATIN 2018: Theoretical Informatics读者反馈




书目名称LATIN 2018: Theoretical Informatics读者反馈学科排名




单选投票, 共有 0 人参与投票
1.jpg
 

0票 0%

Perfect with Aesthetics
2.jpg
 

0票 0%

Better Implies Difficulty
3.jpg
 

0票 0%

Good and Satisfactory
4.jpg
 

0票 0%

Adverse Performance
5.jpg
 

0票 0%

Disdainful Garbage
您所在的用户组没有投票权限
粗略
回复

举报

发表于 2025-3-21 23:09:24 | 显示全部楼层
The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness,f its clique graph and we show graph classes for which these bounds are tight. We prove .-completeness for .-. if the instance is restricted to planar graphs, chordal (2, 1)-graphs, (1, 2)-graphs, diamond-free graphs with diameter five, or for any fixed . at least 3. On the other hand, we improve the complexity for 2-. to a linear-time algorithm.
Pelvic-Floor
回复

举报

发表于 2025-3-22 02:26:05 | 显示全部楼层
verdict
回复

举报

发表于 2025-3-22 06:49:17 | 显示全部楼层
Audiometry
回复

举报

发表于 2025-3-22 12:25:46 | 显示全部楼层
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees,t . is a subgraph of the bounded-degree . of ., and applies Kruskal’s MST algorithm on it. To achieve this with limited workspace, we introduce a compact representation of planar graphs, called an .-. which allows us to manipulate its component structure during the execution of the algorithm.
尊重
回复

举报

发表于 2025-3-22 16:01:08 | 显示全部楼层
accrete
回复

举报

发表于 2025-3-22 17:20:33 | 显示全部楼层
Partitioning Orthogonal Histograms into Rectangular Boxes,osed by Floderus et al. We then show the problem to be APX-hard for histograms of height four. On the positive side, we give polynomial-time algorithms to compute optimal or approximate box partitions for some restricted but interesting classes of polyhedra and 3D-histograms.
来就得意
回复

举报

发表于 2025-3-22 23:04:10 | 显示全部楼层
A Tight Bound for Shortest Augmenting Paths on Trees,ach round one vertex from . with its incident edges arrives. It was conjectured by Chaudhuri et al. [.] that the total length of all shortest augmenting paths found is .. In this paper we prove a tight . upper bound for the total length of shortest augmenting paths for trees improving over . bound [.].
做事过头
回复

举报

发表于 2025-3-23 02:58:27 | 显示全部楼层
量被毁坏
回复

举报

发表于 2025-3-23 08:38:20 | 显示全部楼层
CHOIR
回复

举报

下一页 »
1234567下一页
返回列表
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-13 12:20
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表