logo
logo
x
바코드검색
BOOKPRICE.co.kr
책, 도서 가격비교 사이트
바코드검색

인기 검색어

실시간 검색어

검색가능 서점

도서목록 제공

Walcom: Algorithms and Computation: 18th International Conference and Workshops on Algorithms and Computation, Walcom 2024, Kanazawa, Japan, March 18-

Walcom: Algorithms and Computation: 18th International Conference and Workshops on Algorithms and Computation, Walcom 2024, Kanazawa, Japan, March 18- (Paperback, 2024)

Hsu-chun Yen, Ryuhei Uehara, Katsuhisa Yamanaka (엮은이)
Springer
157,480원

일반도서

검색중
서점 할인가 할인률 배송비 혜택/추가 실질최저가 구매하기
149,600원 -5% 0원
4,490원
145,110원 >
yes24 로딩중
교보문고 로딩중
notice_icon 검색 결과 내에 다른 책이 포함되어 있을 수 있습니다.

중고도서

검색중
서점 유형 등록개수 최저가 구매하기
로딩중

eBook

검색중
서점 정가 할인가 마일리지 실질최저가 구매하기
로딩중

책 이미지

Walcom: Algorithms and Computation: 18th International Conference and Workshops on Algorithms and Computation, Walcom 2024, Kanazawa, Japan, March 18-
eBook 미리보기

책 정보

· 제목 : Walcom: Algorithms and Computation: 18th International Conference and Workshops on Algorithms and Computation, Walcom 2024, Kanazawa, Japan, March 18- (Paperback, 2024) 
· 분류 : 외국도서 > 컴퓨터 > 컴퓨터 공학
· ISBN : 9789819705658
· 쪽수 : 438쪽
· 출판일 : 2024-02-29

목차

Recent Research Activities on Algorithmic Foundations for Social Advancement.- Reasons to Fall (More) in Love with Combinatorial Reconfiguration.- Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle.- Quantum Graph Drawing.- Simultaneous Drawing of Layered Trees.-?Fully Dynamic Algorithms for Euclidean Steiner Tree.- ?The Parameterized Complexity of Terminal Monitoring Set.- Generating cyclic 2-Gray codes for Fibonacci q-decreasing words.- On the Hardness of Gray Code Problems for Combinatorial Objects.- On MAX-SAT with Cardinality Constraint.- Minimizing Corners in Colored Rectilinear Grids.- On Layered Area-Proportional Rectangle Contact Representations.- Short Flip Sequences to Untangle Segments in the Plane.- Improved Approximation Algorithms for Cycle and Path Packings.- Exact and Approximate Hierarchical Hub Labeling.- Reconfiguration of Multisets with Applications to Bin Packing.- The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules.- Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis.- A bisection approach to subcubic maximum induced matching.- Stable and Dynamic Minimum Cuts.- Black Hole Search in Dynamic Cactus Graph.- Recognition and Isomorphism of Proper H-graphs for unicyclic H in FPT-time.- Canonization of a random circulant graph by counting walks.- Counting Vanishing Matrix-Vector Products.- Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs.- (t,s)-completely Independent Spanning Trees.- Orientable Burning Number of Graphs.- Dichotomies for Tree Minor Containment with Structural Parameters.- Structural Parameterizations of Vertex Integrity.- On the Complexity of List H-Packing for Sparse Graph Classes.

이 포스팅은 쿠팡 파트너스 활동의 일환으로,
이에 따른 일정액의 수수료를 제공받습니다.
이 포스팅은 제휴마케팅이 포함된 광고로 커미션을 지급 받습니다.
도서 DB 제공 : 알라딘 서점(www.aladin.co.kr)
최근 본 책