Search Results

You are looking at 1 - 2 of 2 items for :

  • Discrete Mathematics x
Clear All
Open access

Peter Recht and Eva-Maria Sprengel

References [1] S. Antonakopulos and L. Zhang, Approximation algorithms for grooming in optical network design, Theoret. Comput. Sci. 412 (2011) 3738-3751. doi:10.1016/j.tcs.2011.03.034 [2] F. Bäbler, Über eine spezielle Klasse Euler’scher Graphen, Comment. Math. Helv. 27 (1953) 81-100. doi:10.1007/BF02564555 [3] V. Bafna and P.A. Pevzner, Genome rearrangement and sorting by reversals, SIAM J. Comput. 25 (1996) 272-289. doi:10.1137/S0097539793250627 [4] A. Caprara, Sorting permutations by

Open access

Allan Bickle

References [1] M. Altaf-Ul-Amin, K. Nishikata, T. Koma, T.Miyasato, Y. Shinbo, M. Arifuzzaman, C. Wada, M. Maeda, et al., Prediction of protein functions based on k-cores of protein-protein interaction networks and amino acid sequences, Genome Informatics 14 (2003) 498-499. [2] J. Alvarez-Hamelin, L. Dall’Asta, A. Barrat, A. Vespignani, k-core decomposition: a tool for the visualization of large scale networks, Adv. Neural Inf. Process. Syst. 18 (2006) 41. [3] G. Bader, C. Hogue, An automated method for finding