Computational aspects of lucidity-driven graph clustering.
Görke, Robert, Gaertler, Marco, Hübner, Florian, Wagner, Dorothea (2010)
Journal of Graph Algorithms and Applications
Similarity:
Görke, Robert, Gaertler, Marco, Hübner, Florian, Wagner, Dorothea (2010)
Journal of Graph Algorithms and Applications
Similarity:
Brandes, Ulrik, Pich, Christian (2011)
Journal of Graph Algorithms and Applications
Similarity:
Dražić, Zorica (2012)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): I.2.8, G.1.6. In this paper a file transfer scheduling problem is considered. This problem is known to be NP-hard, and thus provides a challenging area for metaheuristics. A variable neighborhood search algorithm is designed for the transfer scheduling of files between various nodes of a network, by which the overall transfer times are to be minimized. Optimality of VNS solutions on smaller size instances has been verified by total...
Levitin, Lev, Karpovsky, Mark, Mustafa, Mehmet, Zakrevski, Lev (2006)
Journal of Graph Algorithms and Applications
Similarity:
Dragoš Cvetković, Mirjana Čangalović, Vera Kovačević-Vujčić (2004)
Zbornik Radova
Similarity:
Ghattas, Badih, Perera, Gonzalo (2006)
Boletín de la Asociación Matemática Venezolana
Similarity:
Dragan Matić, Milan Božić (2012)
The Teaching of Mathematics
Similarity:
Gansner, Emden, Hu, Yifan (2010)
Journal of Graph Algorithms and Applications
Similarity:
Hüffner, Falk (2009)
Journal of Graph Algorithms and Applications
Similarity:
Tatjana Aleksić, I. Gutman, M. Petrović (2007)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Markowsky, Greg, Koolen, Jacobus (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: