Author： Berry Anne Blair Jean R. S. Heggernes Pinar Peyton Barry W.
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.39, Iss.4, 2004-05, pp. : 287-298
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Minimal cost linkages in graphs
By Harrison S.A. Rayward-Smith V.J.
Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. :
Access to resources
Recommend
Computing minimal models by partial instantiation
By Kagan V. Nerode A. Subrahmanian V.S.
Theoretical Computer Science, Vol. 155, Iss. 1, 1996-02 ,pp. :
Computing the Map of Geometric Minimal Cuts
By Xu Jinhui Xu Lei Papadopoulou Evanthia
Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. :
A practical algorithm for making filled graphs minimal
By Blair J.R.S. Heggernes P. Telle J.A.
Theoretical Computer Science, Vol. 250, Iss. 1, 2001-01 ,pp. :