An efficient algorithm for the All Pairs Suffix-Prefix Problem
- 作者Dan Gusfield; Gad M. Landau; Baruch Schieber
- 卷第41卷
- 期第4期
- 印刷ISSN0020-0190
- 文件大小385.46KB
- 发表时间1992
- DOI10.1016/0020-0190(92)90176-v
- 页码181-185
Construction of Hamilton Path Tournament DesignsYoshiko T. Ikebe; Akihisa Tamura · 2011
Algorithms for finding a Kth best valued assignmentTomomi Matsui; Akihisa Tamura; Yoshiko Ikebe · 1994
On the existence of sports schedules with multiple venuesYoshiko T. Ikebe; Akihisa Tamura · 2008
Ideal polytopes and face structures of some combinatorial optimization problemsYoshiko T. Ikebe; Akihisa Tamura · Mathematical Programming · 1995
The rooted tree embedding problem into points in the planeYoshiko Ikebe; Micha A. Perles; Akihisa Tamura; Shinnichi Tokunaga · 1994
ON A LABOR ALLOCATION MODEL WITH POSSIBLY BOUNDED SALARIESFarooq, Rashid; Ikebe, Yoshiko T; Tamura, Akihisa · Journal of the Operations Research Society of Japan · 2008
STABILITY IN SUPPLY CHAIN NETWORKS: AN APPROACH BY DISCRETE CONVEX ANALYSIST Ikebe, Yoshiko; Tamura, Akihisa · Journal of the Operations Research Society of Japan · 2015