Sciweavers

3268 search results - page 300 / 654
» The hub number of a graph
Sort
View
BIRTHDAY
2009
Springer
16 years 1 months ago
Properly Coloured Cycles and Paths: Results and Open Problems
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
Gregory Gutin, Eun Jung Kim
CPM
2004
Springer
87views Combinatorics» more  CPM 2004»
16 years 4 days ago
A Trie-Based Approach for Compacting Automata
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression...
Maxime Crochemore, Chiara Epifanio, Roberto Grossi...
EUROPAR
2004
Springer
16 years 4 days ago
Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
Kayhan Erciyes
IPTPS
2003
Springer
15 years 12 months ago
Koorde: A Simple Degree-Optimal Distributed Hash Table
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
M. Frans Kaashoek, David R. Karger
172
Voted
GECCO
2000
Springer
145views Optimization» more  GECCO 2000»
15 years 10 months ago
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
Shouichi Matsui, Ken-ichi Tokoro