Period of time： 2004年2期
Publisher： Academic Press
Founded in： 1980
Total resources： 32
ISSN： 0196-6774
Subject： O Mathematical Sciences and Chemical
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Journal of Algorithms,volume 21,issue 2
Menu
On-line Planar Graph Embedding
Journal of Algorithms,volume 21,issue 2 , Vol. 21, Iss. 2, 1996-09 , pp.
Access to resources
Recommend
On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions
By Tseng P.,Luo Z.Q. in (1996)
Journal of Algorithms,volume 21,issue 2 , Vol. 21, Iss. 2, 1996-09 , pp.An Incremental Algorithm for a Generalization of the Shortest-Path Problem
By Ramalingam G.,Reps T. in (1996)
Journal of Algorithms,volume 21,issue 2 , Vol. 21, Iss. 2, 1996-09 , pp.By Narayanan H.,Roy S.,Patkar S. in (1996)
Journal of Algorithms,volume 21,issue 2 , Vol. 21, Iss. 2, 1996-09 , pp.Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
Journal of Algorithms,volume 21,issue 2 , Vol. 21, Iss. 2, 1996-09 , pp.Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
By Bodlaender H.L.,Kloks T. in (1996)
Journal of Algorithms,volume 21,issue 2 , Vol. 21, Iss. 2, 1996-09 , pp.Approximation Algorithms for Network Design Problems on Bounded Subsets
By Hochbaum D.S.,Naor J.S. in (1996)
Journal of Algorithms,volume 21,issue 2 , Vol. 21, Iss. 2, 1996-09 , pp.Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
Journal of Algorithms,volume 21,issue 2 , Vol. 21, Iss. 2, 1996-09 , pp.Improved Approximation Algorithms for Uniform Connectivity Problems
By Khuller S.,Raghavachari B. in (1996)
Journal of Algorithms,volume 21,issue 2 , Vol. 21, Iss. 2, 1996-09 , pp.