M. Sohel Rahman; Etsuji Tomita WALCOM: Algorithms and Computation 9783319156118

Варианты приобретения

Цена: 7826.00р.
Кол-во:
Наличие: Поставка под заказ. Есть в наличии на складе поставщика.
Склад Америка: Есть
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину

в Мои желания

Автор: M. Sohel Rahman; Etsuji Tomita
Название: WALCOM: Algorithms and Computation
ISBN: 9783319156118
Издательство: Springer
Классификация: ISBN-10: 331915611X
Обложка/Формат: Paperback
Страницы: 336
Вес: 0.51 кг.
Дата издания: 06.02.2015
Серия: Theoretical Computer Science and General Issues
Язык: English
Размер: 234 x 156 x 19
Основная тема: Computer Science
Подзаголовок: 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015, Proceedings
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: 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).- PTASs 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.

WALCOM: Algorithms and Computation, M. Sohel Rahman; Etsuji Tomita