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

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

Two linear time algorithms for MST on minor closed graph classes

Martin Mareš (2004)

Archivum Mathematicum

Similarity:

This article presents two simple deterministic algorithms for finding the Minimum Spanning Tree in O ( | V | + | E | ) time for any non-trivial class of graphs closed on graph minors. This applies in particular to planar graphs and graphs of bounded genus. Both algorithms run on a pointer machine and they require no a priori knowledge of the structure of the class except for its density. Edge weights are only compared.