Packing bipartite graphs with covers of complete bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
We discuss 11 known basic models of distributed computing: four message-passing models that differ by the (non)existence of port-numbers and a hierarchy of seven local computations models. In each of these models, we study the computational complexity of the decision problems if the leader election and if the naming problem can be solved on a given network. It is already known that these two decision problems are solvable in polynomial time for two models and are co-NP-complete for another one. Here, we settle the computational complexity for both problems in the remaining eight models by showing that they are co-NP-complete. We do this by translating each problem into a graph labeling problem. By using this technique, we also obtain an alternative proof for the already known co-NP-completeness result. In the second part of our article, we completely classify the computational complexity of all the corresponding graph labeling problems, i.e., for every fixed integer $k\geq 1$ we determine the complexity of the problem that asks whether a given graph allows a certain graph labeling that uses at most k labels. We also explain the close relationship of these labelings to graph homomorphisms that satisfy some further (global or local) constraints. This yields a new class of “constrained” graph homomorphisms that include the already known locally constrained graph homomorphisms. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011 An abstract of this paper appeared in the Proceedings of the 32th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006).