Graph Radiocoloring Concepts
R. Kalfakakou, G. Nikolakopoulou, E. Savvidou, M. Tsouros (2003)
The Yugoslav Journal of Operations Research
Similarity:
R. Kalfakakou, G. Nikolakopoulou, E. Savvidou, M. Tsouros (2003)
The Yugoslav Journal of Operations Research
Similarity:
Piotr Formanowicz, Krzysztof Tanaś (2012)
International Journal of Applied Mathematics and Computer Science
Similarity:
It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them. We show a randomized algorithmic way of finding Fan-Raspaud colorings of a given cubic graph and, analyzing the computer results, we try to find and describe the Fan-Raspaud colorings for some selected classes of cubic graphs. The presented algorithms can then be applied to the pair assignment problem in cubic computer networks....
Ding, Man, Sun, Wei, Chen, Hanning (2010)
Mathematical Problems in Engineering
Similarity:
Philippe Meurdesoif, Benoît Rottembourg (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper we will describe a new class of coloring problems, arising from military frequency assignment, where we want to minimize the number of distinct -uples of colors used to color a given set of -complete-subgraphs of a graph. We will propose two relaxations based on Semi-Definite Programming models for graph and hypergraph coloring, to approximate those (generally) NP-hard problems, as well as a generalization of the works of Karger et al. for hypergraph coloring, to find...
Eppstein, David (2003)
Journal of Graph Algorithms and Applications
Similarity:
Piotr Borowiecki (2006)
Discussiones Mathematicae Graph Theory
Similarity:
For a given induced hereditary property 𝓟, a 𝓟-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property 𝓟. We consider the effectiveness of on-line 𝓟-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function of any stingy on-line 𝓟-coloring algorithm. In the...
Halldórsson, Magnús M. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sacha Varone, Nicolas Zufferey (2008)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually....
Matic, Dragan (2012)
Serdica Journal of Computing
Similarity:
This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements. An efficient local search procedure swaps the components of pairs of elements and yields a relatively short running time. Numerical experiments are performed on the instances known in the literature: minimum hitting set and Steiner triple systems. Computational...
Zhou, Xiao, Nishizeki, Takao (1999)
Journal of Graph Algorithms and Applications
Similarity:
Dumitrescu, Adrian, Guha, Sumanta (2004)
Journal of Graph Algorithms and Applications
Similarity: