Minimal cost linkages in graphs

Author： Harrison S.A.   Rayward-Smith V.J.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.86, Iss.1, 1999-01, pp. : 295-319

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

By Berry Anne   Blair Jean R. S.   Heggernes Pinar   Peyton Barry W.  

Algorithmica, Vol. 39, Iss. 4, 2004-05 ,pp. : 287-298

Springer Publishing Company

Access to resources Recommend Favorite

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. : 125-141

Elsevier

Access to resources Recommend Favorite

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

By Ljubić Ivana   Raidl Günther R.  

Journal of Heuristics, Vol. 9, Iss. 5, 2003-11 ,pp. : 401-427

Springer Publishing Company

Access to resources Recommend Favorite

Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)

By Karavai M.   Parkhomenko P.   Podlazov V.  

Automation and Remote Control, Vol. 70, Iss. 2, 2009-02 ,pp. : 312-327

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Flexible full-body tactile sensor of low cost and minimal output connections for service robot

By Pan Zengxi   Zhu Zhenqi  

Industrial Robot: An International Journal, Vol. 32, Iss. 6, 2005-01 ,pp. : 485-491

Emerald Group Publishing Ltd

Access to resources Recommend Favorite