Recognizing Treelike k -Dissimilarities

ISSN： 0176-4268

Source： Journal of Classification, Vol.29, Iss.3, 2012-10, pp. : 321-340

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

Autoduality for treelike curves with planar singularities

By Esteves Eduardo Rocha Flávio

Bulletin of the Brazilian Mathematical Society, Vol. 44, Iss. 3, 2013-09 ,pp. : 413-420

Springer Publishing Company

Access to resources Recommend Favorite

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

Recognizing underlying sparsity in optimization

By Kim Sunyoung

Mathematical Programming, Vol. 119, Iss. 2, 2009-07 ,pp. : 273-303

Springer Publishing Company

Access to resources Recommend Favorite

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

By Sharifov F. A.

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

Springer Publishing Company

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