國立虎尾科技大學 |

WALCOM: Algorithms and Computation = 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	WALCOM: Algorithms and Computation/ edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung.
其他題名:	14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings /
其他作者:	Sung, Wing-Kin.
面頁冊數:	XIII, 350 p. 140 illus., 55 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Artificial Intelligence. -
電子資源:	https://doi.org/10.1007/978-3-030-39881-1
ISBN:	9783030398811

WALCOM: Algorithms and Computation = 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings /
WALCOM: Algorithms and Computation14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings /[electronic resource] :edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung. - 1st ed. 2020. - XIII, 350 p. 140 illus., 55 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12049. - Theoretical Computer Science and General Issues ;9163.

Drawing Planar Graphs -- Space Efficient Separator Algorithms for Planar Graphs -- Recent progresses in the combinatorial and algorithmic study of phylogenetic networks -- Optimum Algorithm for the Mutual Visibility Problem -- Routing in Histograms -- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Micro uidic Chips -- Shortest Covers of All Cyclic Shifts of a String -- Packing Trees into 1-planar Graphs -- Angle Covers: Algorithms and Complexity -- Fast Multiple Pattern Cartesian Tree Matching -- Generalized Dictionary Matching under Substring Consistent Equivalence Relations -- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons -- Maximum Bipartite Subgraph of Geometric Intersection Graphs -- The Stub Resolution of 1-planar Graphs -- Dispersion of Mobile Robots on Grids -- Packing and Covering with Segments -- Implicit Enumeration of Topological-Minor-Embeddings and Ist Application to Planar Subgraph Enumeration -- Partitioning a graph into complementary subgraphs -- On the Maximum Edge-Pair Embedding Bipartite Matching -- Packing Arc-Disjoint Cycles in Bipartite Tournaments -- Matching random colored points with rectangles -- Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams -- Approximability of the Independent Fedback Vertex Set Problem for Bipartite Graphs -- Efficient Enumeration of Non-isomorphic Ptolemaic Graphs -- Faster Privacy-Preserving Computation of Edit Distance with Moves -- Parameterized Algorithms for the Happy Set Problem -- An Experimental Study of a 1-planarity Testing and Embedding Algorithm -- Trichotomy for the recon guration problem of integer linear systems -- Train Scheduling: Hardness and Algorithms.

This book constitutes the refereed proceedings of the 14th International Conference on Algorithms and Computation, WALCOM 2020, held in Singapore in March/April 2020. The 23 full and 4 short papers presented were carefully reviewed and selected from 66 submissions. The papers focus on algorithmic graph theory and combinatorics, computational biology, computational geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, network optimization.

ISBN: 9783030398811

Standard No.: 10.1007/978-3-030-39881-1doiSubjects--Topical Terms:

646849
Artificial Intelligence.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

WALCOM: Algorithms and Computation = 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings /
LDR:03788nam a22004095i 4500 001 1018163
003 DE-He213
005 20200706071419.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030398811 $9 978-3-030-39881-1
024 7 $a 10.1007/978-3-030-39881-1 $2 doi
035 $a 978-3-030-39881-1
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a WALCOM: Algorithms and Computation $h [electronic resource] : $b 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings / $c edited by M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XIII, 350 p. 140 illus., 55 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 12049
505 0 $a Drawing Planar Graphs -- Space Efficient Separator Algorithms for Planar Graphs -- Recent progresses in the combinatorial and algorithmic study of phylogenetic networks -- Optimum Algorithm for the Mutual Visibility Problem -- Routing in Histograms -- A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Micro uidic Chips -- Shortest Covers of All Cyclic Shifts of a String -- Packing Trees into 1-planar Graphs -- Angle Covers: Algorithms and Complexity -- Fast Multiple Pattern Cartesian Tree Matching -- Generalized Dictionary Matching under Substring Consistent Equivalence Relations -- Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons -- Maximum Bipartite Subgraph of Geometric Intersection Graphs -- The Stub Resolution of 1-planar Graphs -- Dispersion of Mobile Robots on Grids -- Packing and Covering with Segments -- Implicit Enumeration of Topological-Minor-Embeddings and Ist Application to Planar Subgraph Enumeration -- Partitioning a graph into complementary subgraphs -- On the Maximum Edge-Pair Embedding Bipartite Matching -- Packing Arc-Disjoint Cycles in Bipartite Tournaments -- Matching random colored points with rectangles -- Designing Survivable Networks with Zero-suppressed Binary Decision Diagrams -- Approximability of the Independent Fedback Vertex Set Problem for Bipartite Graphs -- Efficient Enumeration of Non-isomorphic Ptolemaic Graphs -- Faster Privacy-Preserving Computation of Edit Distance with Moves -- Parameterized Algorithms for the Happy Set Problem -- An Experimental Study of a 1-planarity Testing and Embedding Algorithm -- Trichotomy for the recon guration problem of integer linear systems -- Train Scheduling: Hardness and Algorithms.
520 $a This book constitutes the refereed proceedings of the 14th International Conference on Algorithms and Computation, WALCOM 2020, held in Singapore in March/April 2020. The 23 full and 4 short papers presented were carefully reviewed and selected from 66 submissions. The papers focus on algorithmic graph theory and combinatorics, computational biology, computational geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, network optimization.
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Algorithms. $3 527865
700 1 $a Sung, Wing-Kin. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1129981
700 1 $a Sadakane, Kunihiko. $e author. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1023597
700 1 $a Rahman, M. Sohel. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1066355
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030398804
776 0 8 $i Printed edition: $z 9783030398828
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-39881-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)