國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

WALCOMalgorithms and computation : 9...

(1998 :)

WALCOMalgorithms and computation : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	WALCOMedited by M. Sohel Rahman, Etsuji Tomita.
其他題名:	algorithms and computation : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015 : proceedings /
其他題名:	WALCOM 2015
其他作者:	Rahman, M. Sohel.
團體作者:
出版者:	Cham :Springer International Publishing :2015.
面頁冊數:	xxiv, 336 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer algorithmsCongresses.
電子資源:	http://dx.doi.org/10.1007/978-3-319-15612-5
ISBN:	9783319156125 (electronic bk.)

WALCOMalgorithms and computation : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015 : proceedings /
WALCOMalgorithms and computation : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015 : proceedings /[electronic resource] :WALCOM 2015edited by M. Sohel Rahman, Etsuji Tomita. - Cham :Springer International Publishing :2015. - xxiv, 336 p. :ill., digital ;24 cm. - Lecture notes in computer science,89730302-9743 ;. - Lecture notes in computer science ;4891..

Encoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS's for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs.

This book constitutes the thoroughly refereed conference proceedings of the 9th International Workshop on Algorithms and Computation, WALCOM 2015, held in Dhaka, Bangladesh, in February 2015. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 85 submissions. The papers are organized in topical sections on approximation algorithms, data structures and algorithms, computational geometry, combinatorial algorithms, distributed and online algorithms, graph drawing and algorithms, combinatorial problems and complexity, and graph enumeration and algorithms.

ISBN: 9783319156125 (electronic bk.)

Standard No.: 10.1007/978-3-319-15612-5doiSubjects--Topical Terms:

380777
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

WALCOMalgorithms and computation : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015 : proceedings /
LDR:03672nmm a2200337 a 4500 001 461762
003 DE-He213
005 20150916134252.0
006 m d
007 cr nn 008maaau
008 151110s2015 gw s 0 eng d
020 $a 9783319156125 (electronic bk.)
020 $a 9783319156118 (paper)
024 7 $a 10.1007/978-3-319-15612-5 $2 doi
035 $a 978-3-319-15612-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W156 2015
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a WALCOM $h [electronic resource] : $b algorithms and computation : 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015 : proceedings / $c edited by M. Sohel Rahman, Etsuji Tomita.
246 3 $a WALCOM 2015
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xxiv, 336 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 8973
505 0 $a Encoding Data Structures -- Fast Algorithms for Constrained Graph Density Problems -- The Directed Ring Loading with Penalty Cost -- Edge-Colorings of Weighted Graphs (Extended Abstract) -- Unit Covering in Color-Spanning Set Model -- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem -- A Practical Succinct Data Structure for Tree-Like Graphs -- Forming Plurality at Minimum Cost -- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs -- Straight-Path Queries in Trajectory Data -- Folding a Paper Strip to Minimize Thickness -- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract) -- PTAS's for Some Metric p-source Communication Spanning Tree Problems -- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement -- Enumerating Eulerian Trails via Hamiltonian Path Enumeration -- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees -- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks -- Dynamic Online Multiselection in Internal and External Memory -- Competitive Analysis for Multi-objective Online Algorithms -- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends -- An Improved Algorithm for Parameterized Edge Dominating Set Problem -- On Bar (1, j)-Visibility Graphs (Extended Abstract) -- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs -- Non-repetitive Strings over Alphabet Lists -- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes -- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid -- Threshold Circuits for Global Patterns in 2-Dimensional Maps -- Superset Generation on Decision Diagrams -- On Triangle Cover Contact Graphs -- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs.
520 $a This book constitutes the thoroughly refereed conference proceedings of the 9th International Workshop on Algorithms and Computation, WALCOM 2015, held in Dhaka, Bangladesh, in February 2015. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 85 submissions. The papers are organized in topical sections on approximation algorithms, data structures and algorithms, computational geometry, combinatorial algorithms, distributed and online algorithms, graph drawing and algorithms, combinatorial problems and complexity, and graph enumeration and algorithms.
650 0 $a Computer algorithms $v Congresses. $3 380777
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Math Applications in Computer Science. $3 273991
650 2 4 $a Symbolic and Algebraic Manipulation. $3 273720
650 2 4 $a Computer Graphics. $3 274515
650 2 4 $a Algorithms. $3 184661
700 1 $a Rahman, M. Sohel. $3 714088
700 1 $a Tomita, Etsuji. $3 714089
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-15612-5
950 $a Computer Science (Springer-11645)