Computational aspects of lucidity-driven graph clustering.

Görke, Robert; Gaertler, Marco; Hübner, Florian; Wagner, Dorothea

Displaying similar documents to “Computational aspects of lucidity-driven graph clustering.”

Approximating clustering coefficient and transitivity.

Schank, Thomas, Wagner, Dorothea (2005)

Journal of Graph Algorithms and Applications

Similarity:

More flexible radial layout.

Brandes, Ulrik, Pich, Christian (2011)

Journal of Graph Algorithms and Applications

Similarity:

On computing quaternion quotient graphs for function fields

Gebhard Böckle, Ralf Butenuth (2012)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let $Λ$ be a maximal $𝔽_{q} [T]$ -order in a division quaternion algebra over $𝔽_{q} (T)$ which is split at the place $\infty$ . The present article gives an algorithm to compute a fundamental domain for the action of the group of units $Λ^{*}$ on the Bruhat-Tits tree $𝒯$ associated to ${PGL}_{2} (𝔽_{q} ((1 / T)))$ . This action is a function field analog of the action of a co-compact Fuchsian group on the upper half plane. The algorithm also yields an explicit presentation of the group $Λ^{*}$ in terms of generators and relations. Moreover we determine an...

Variable Neighborhood Search for the File Transfer Scheduling Problem

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...