( en | de | ru )

 

Disambiguation of "Křivánek, Mirko"

Author of the publication

copydeleteadd this publication to your clipboard
NP-hard problems in hierarchical-tree clustering

, and . Acta Informatica, 23 (3): 311--323 (1986)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sabine Mirkovic

Elisabeth Mirkowitsch

Milijana Mirkovic-Hösle

Jelena Mirkovi

Mijo Mirkovi

 

Other publications of authors with the same name

NP-hard problems in hierarchical-tree clustering, and . Acta Informatica, 23 (3): 311--323 (1986)An application of limited branching in clustering.. Pattern Recognit. Lett., 3 (5): 299-301 (1985)Satisfiability of Co-Nested Formulas., and . Acta Inf., 30 (4): 397-403 (1993)Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete., and . FCT, volume 199 of Lecture Notes in Computer Science, page 234-241. Springer, (1985)Hexagonal Unit Network a Tool for Proving the NP-Completeness Results of Geometric Problems.. Inf. Process. Lett., 22 (1): 37-41 (1986)A Note on the Computational Complexity of Bracketing and Related Problems.. IMYCS, volume 381 of Lecture Notes in Computer Science, page 136-145. Springer, (1988)Simulated Annealing: A Proof of Convergence., , and . IEEE Trans. Pattern Anal. Mach. Intell., 16 (6): 652-656 (1994)The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering.. MFCS, volume 452 of Lecture Notes in Computer Science, page 392-398. Springer, (1990)NP -Hard Problems in Hierarchical-Tree Clustering., and . Acta Inf., 23 (3): 311-323 (1986)On the Computational Complexity of Codes in Graphs., and . MFCS, volume 324 of Lecture Notes in Computer Science, page 396-404. Springer, (1988)