The MathNet Korea
Information Center for Mathematical Science

### 논문검색

Information Center for Mathematical Science

SIAM Journal on Computing
( Vol.24 NO.3 / 1995 )
 A General Approach to Removing Degeneracies Pages 650-664 A Variational Method for Analysing Unit Clause Search Pages 621-649 Approximate Max-Flow on Small Depth Networks Pages 579-597 Efficient Algorithms for the Hitchcock Transformation Pages 563-578 A Generalization of the Suffix Tree to Square Matrices, with Applications Pages 520-562 Tree Reconstruction from Partial Orders Pages 511-519 A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph Pages 598-620 Counterexamples for Directed and Node Capacitated Cut-Trees Pages 505-510 Scaling Algorithms for the Shortest Paths Problem Pages 494-504 When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem ? Pages 484-493 Evaluation of Polynomials Using the Structure of the Coefficients Pages 473-483 Rectilinear Path Problems among Rectilinear Obstacles Revisited Pages 457-472 When Threes Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks Pages 440-456 $O (M \cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs Pages 411-439 A Priori Bounds on the Euclidean Traveling Salesman Pages 665-671