東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

WALCOM = algorithms and computation ...

WALCOM (Workshop) (2021 :)

FindBook

Google Book

Amazon

博客來

WALCOM = algorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	WALCOM/ edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy.
其他題名:	algorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings /
其他題名:	WALCOM 2021
其他作者:	Uehara, Ryuhei.
團體作者:	WALCOM (Workshop)
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xv, 334 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Computer algorithms - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-030-68211-8
ISBN:	9783030682118

WALCOM = algorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings /
WALCOMalgorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings /[electronic resource] :WALCOM 2021edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy. - Cham :Springer International Publishing :2021. - xv, 334 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,126350302-9743 ;. - Lecture notes in computer science ;12635..

This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverse areas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.

ISBN: 9783030682118

Standard No.: 10.1007/978-3-030-68211-8doiSubjects--Topical Terms:

576357
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43 / W35 2021

Dewey Class. No.: 005.1

WALCOM = algorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings /
LDR:02218nmm a2200361 a 4500 001 2301567
003 DE-He213
005 20220223041155.0
006 m d
007 cr nn 008maaau
008 230409s2021 sz s 0 eng d
020 $a 9783030682118 $q (electronic bk.)
020 $a 9783030682101 $q (paper)
024 7 $a 10.1007/978-3-030-68211-8 $2 doi
035 $a 978-3-030-68211-8
035 $a 2301567
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b W35 2021
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W156 2021
111 2 $a WALCOM (Workshop) $n (15th : $d 2021 : $c Online) $3 3601103
245 1 0 $a WALCOM $h [electronic resource] : $b algorithms and computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings / $c edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy.
246 3 $a WALCOM 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xv, 334 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12635
490 1 $a Theoretical computer science and general issues
520 $a This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverse areas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms.
650 0 $a Computer algorithms $x Congresses. $3 576357
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Data Structures and Information Theory. $3 3382368
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
650 2 4 $a Computer Graphics. $3 892532
650 2 4 $a Computer and Information Systems Applications. $3 3538505
700 1 $a Uehara, Ryuhei. $3 1002469
700 1 $a Hong, Seok-Hee. $3 901007
700 1 $a Nandy, Subhas C. $3 3601104
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 12635. $3 3601105
830 0 $a Theoretical computer science and general issues. $3 3382501
856 4 0 $u https://doi.org/10.1007/978-3-030-68211-8
950 $a Computer Science (SpringerNature-11645)