Covering edges by cliques with regard to keyword conflicts and intersection graphs

Authors:
L. T. Kou;L. J. Stockmeyer;C. K. Wong
Affiliations:
IBM Thomas J. Watson Research Center, Yorktown Heights, NY;IBM Thomas J. Watson Research Center, Yorktown Heights, NY;IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Venue:
Communications of the ACM
Year:
1978

Citing 2
Cited 16

The Complexity of Near-Optimal Graph Coloring

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

Edge concentration: a method for clustering directed graphs

SCM '89 Proceedings of the 2nd International Workshop on Software configuration management
On the hardness of approximating minimization problems

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
On the Tree-Degree of Graphs

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Analyzing Ultra-Scale Application Communication Requirements for a Reconfigurable Hybrid Interconnect

SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Algorithms for compact letter displays: Comparison and evaluation

Computational Statistics & Data Analysis
Covering Arrays Avoiding Forbidden Edges

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Covering arrays avoiding forbidden edges

Theoretical Computer Science
Three-quarter approximation for the number of unused colors in graph coloring

Information Sciences: an International Journal
A note on broadcast encryption key management with applications to large scale emergency alert systems

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Unique intersectability of diamond-free graphs

Discrete Applied Mathematics
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays

Theoretical Computer Science
Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices

SIAM Journal on Scientific Computing
Controlling size when aligning multiple genomic sequences with duplications

WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Finding the best CAFE is NP-hard

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Modeling affiliations in networks

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	48.22

Visualization

Abstract

Kellerman has presented a method for determining keyword conflicts and described a heuristic algorithm which solves a certain combinatorial optimization problem in connection with this method. This optimization problem is here shown to be equivalent to the problem of covering the edges of a graph by complete subgraphs with the objective of minimizing the number of complete subgraphs. A relationship between this edge-clique-cover problem and the graph coloring problem is established which allows algorithms for either one of these problems to be constructed from algorithms for the other. As consequences of this relationship, the keyword conflict problem and the edge-clique-cover problem are shown to be NP-complete, and if P ≠ NP then they do not admit polynomial-time approximation algorithms which always produce solutions within a factor less than 2 from the optimum.