Problems of synthesis of connected networks with respect to isomorphic subgraphs

ISSN： 1060-0396

Source： Cybernetics and Systems Analysis, Vol.40, Iss.5, 2004-09, pp. : 735-738

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

Finding 2-edge connected spanning subgraphs

By Huh W.T.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 212-216

Elsevier

Access to resources Recommend Favorite

Contractible Small Subgraphs in k -connected Graphs

By Fujita Shinya

Graphs and Combinatorics, Vol. 26, Iss. 4, 2010-07 ,pp. : 499-511

Springer Publishing Company

Access to resources Recommend Favorite

A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs

By Dinitz Y. Nutov Z.

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 31-40

Academic Press

Access to resources Recommend Favorite

Generalized Connected Functions with Respect to Cones

By Suneja S.K. Aggarwal S. Davar S.

Journal of Optimization Theory and Applications, Vol. 106, Iss. 2, 2000-08 ,pp. : 399-410

Springer Publishing Company

Access to resources Recommend Favorite

Hydrothermal Synthesis of New Organically Templated Beryllium Phosphite and Phosphate with 3,4‐connected Networks

ZAAC-JOURNAL OF INORGANIC AND GENERAL CHEMISTRY (ELECTRONIC), Vol. 641, Iss. 3, 2015-03 ,pp. : 688-693

John Wiley & Sons Inc

Access to resources Recommend Favorite