The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

SIAM Journal on Computing
( Vol.25 NO.2 / 1996 )
home An Algebraic Model for Combinatorial Problems
Pages 448-476
Richard E. Stearns, Harry B. Hunt III,
home Generated Kraft's Inequality and Discrete $k$-Modal Search
Pages 420-447
Anmol Mathur, Edward M. Reingold,
home An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation
Pages 404-419
C. Rhee, Y. D. Liang, S. K. Dhall, S. Lakshmivarahan,
home Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
Pages 390-403
Xiaotie Deng, Pavol Hell, Jing Huang,
home Optimal Clock Synchronization under Different Delay Assumptions
Pages 369-389
Hagit Attiya, Amir Herzberg, Sergio Rajsbaum,
home Low-Degree Spanning Trees of Small Weight
Pages 355-368
Samir Khuller, Balaji Raghavachari, Neal Young,
home The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
Pages 340-354
Richard Chang, Jim Kadin,
home An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem
Pages 312-339
Vijaya Ramachandran, Honghua Yang,
home Upward Planar Drawing of Single-Source Acyclic Digraphs
Pages 291-311
Michael D. Hutton, Anna Lubiw,
home Note on " A Linear-Time Algorithm for Computing $K$-Terminal Reliability in a Series-Parallel Network"
Pages 290
A. Satyanarayana, R. K. Wood, L. Camarinopoulos, G. Pampoukis,
home Genome Rearrangements and Sorting by Reversals
Pages 272-289
Vineet Bafna, Pavel A. Pevzner,
home Robust Characterizations of Polynomials with Applications to Program Testing
Pages 252-271
Ronitt Rubinfeld, Madhu Sudan,
home Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
Pages 235-251
Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis,
home An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation
Pages 404-419
C. Rhee, Y. D. Liang, S. K. Dhall, S. Lakshmivarahan,