Cantitate/Preț
Produs
Total produse
Vezi coșul
WALCOM: Algorithms and Computation de Chun-Cheng Lin

WALCOM: Algorithms and Computation: Lecture Notes in Computer Science

Editat de Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta
en Limba Engleză Paperback – 19 feb 2023
This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023.
The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 49096 lei

Preț vechi: 61371 lei
-20%

Puncte Express: 736
Preț estimativ în valută:
8691€ • 10112$ • 7537£

Carte tipărită la comandă

Livrare economică 28 februarie-14 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031270505
ISBN-10: 3031270509
Pagini: 412
Ilustrații: XIII, 398 p. 106 illus., 49 illus. in color.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1st edition 2023
Editura: Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Invited Talks.- Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult.- The Family of Fan-planar Graphs.- Computational Geometry.- Minimum Ply Covering of Points with Unit Squares.- Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms.- Flipping Plane Spanning Paths.- Away from Each Other.- Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree.- Reflective Guarding a Gallery.- Improved and Generalized Algorithms for Burning a Planar Point Set.- On the Longest Flip Sequence to Untangle Segments in the Plane.- String Algorithm.-Inferring Strings from Position Heaps in Linear Time.- Internal Longest Palindrome Queries in Optimal Time.- Finding the Cyclic Covers of a String.- Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs.- Optimization.- Better Hardness Results for the Minimum Spanning Tree Congestion
Problem.- Energy Efficient Sorting, Selection and Searching.- Reconfiguration of Vertex-disjoint Shortest Paths on Graphs.- k-Transmitter Watchman Routes.- Graph Algorithm.- Splitting Plane Graphs to Outerplanarity.- Certifying Induced Subgraphs in Large Graphs.- Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs.- On the Complexity of Distance-d Independent Set Reconfiguration.- On Star-multi-interval Pairwise Compatibility Graphs.- Parameterized Complexity of Optimizing List Vertex-Coloring through Reconfiguration.- Parameterized Complexity of Path Set Packing.- Approximation Algorithm.- Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput.- Recognizing When a Preference System Is Close to Admitting a Master List.- Groups Burning: Analyzing Spreading Processes in Community-based Networks.- Roman k-domination:Hardness, Approximation and Parameterized Results.- Parameterized Complexity.- On the Parameterized Complexity of Compact Set Packing.- Structural Parameterization of Cluster Deletion.- Parity Permutation Pattern Matching.