Sciweavers

236 search results - page 39 / 48
» Graphs, partitions and Fibonacci numbers
Sort
View
ARSCOM
2006
81views more  ARSCOM 2006»
13 years 8 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
13 years 11 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
SPDP
1991
IEEE
13 years 11 months ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein
WEA
2005
Springer
98views Algorithms» more  WEA 2005»
14 years 1 months ago
Implementing Minimum Cycle Basis Algorithms
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Kurt Mehlhorn, Dimitrios Michail
IPPS
2002
IEEE
14 years 26 days ago
A Recursion-Based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks
: A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented in this paper. It works by partitioning the graph into several s...
Xiaotong Zhuang, Vincenzo Liberatore