Efficiency of Algorithms for Solution of Network Problems with Tree-Like Data Structure

ISSN： 1060-0396

Source： Cybernetics and Systems Analysis, Vol.39, Iss.3, 2003-05, pp. : 467-470

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

Near Optimal Separation Of Tree-Like And General Resolution

By Ben-Sasson* Eli Impagliazzo† Russell Wigderson‡ Avi

Combinatorica, Vol. 24, Iss. 4, 2004-09 ,pp. : 585-603

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Network Design Problems on Bounded Subsets

By Hochbaum D.S. Naor J.S.

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 403-414

Academic Press

Access to resources Recommend Favorite

A self-map of a tree-like continuum with no invariant indecomposable subcontinuum

By Minc P.

Topology and its Applications, Vol. 98, Iss. 1, 1999-11 ,pp. : 235-240

Elsevier

Access to resources Recommend Favorite

Bounded-degree spanning tree problems: models and new algorithms

By Cerulli R. Gentili M. Iossa A.

Computational Optimization and Applications, Vol. 42, Iss. 3, 2009-04 ,pp. : 353-370

Springer Publishing Company

Access to resources Recommend Favorite

Research on convergence of multipopulation binary‐ and real‐coded genetic algorithms for solution of crystal structure from X‐Ray powder diffraction data

CRYSTAL RESEARCH AND TECHNOLOGY (ELECTRONIC), Vol. 50, Iss. 9-10, 2015-09 ,pp. : 724-728

John Wiley & Sons Inc

Access to resources Recommend Favorite