𝔖 Bobbio Scriptorium
✦   LIBER   ✦

NP-Completeness of graph decomposition problems

✍ Scribed by Edith Cohen; Michael Tarsi

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
689 KB
Volume
7
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Le probleme d'etoiles pour graphes est n
Le probleme d'etoiles pour graphes est np-complet
✍ FranΓ§ois Lalonde πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 884 KB

Nous appelons problkme de "recoIlement de voisinages" (RV) ("'star prnblem" ou "problk~e d'ktoiles") le probEme qui consiste B savoir, &ant donnee une familje 3r de parties d'un ensemble S, s'il existe un graphe (non orient4 et sans bouclc) dont la famille de voisinages coincide avec 9". L'objectif

NP completeness of the edge precoloring
NP completeness of the edge precoloring extension problem on bipartite graphs
✍ JiΕ™Γ­ Fiala πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 63 KB πŸ‘ 1 views

## Abstract We show that the following problem is __NP__ complete: Let __G__ be a cubic bipartite graph and __f__ be a precoloring of a subset of edges of __G__ using at most three colors. Can __f__ be extended to a proper edge 3‐coloring of the entire graph __G__? This result provides a natural co

On the np-completeness of certain networ
On the np-completeness of certain network testing problems
✍ S. Even; O. Goldreich; S. Moran; P. Tong πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 946 KB

Let G ( V , E) be an undirected graph which describes the structure of a communication network. During the maintenance period every line must be tested in each of the two possible directions. A line is tested by assigning one of its endpoints t o be a transmitter, the other to be a receiver, and sen