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

DOI10.1145/359340.359346zbMath0367.68035OpenAlexW2145152745MaRDI QIDQ4144194

No author found.

Publication date: 1978

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359340.359346

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (05C99) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (48)

Matrix models for \(\varepsilon\)-free independence ⋮ An overview of graph covering and partitioning ⋮ Known Algorithms for Edge Clique Cover are Probably Optimal ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ On the intractability landscape of digraph intersection representations ⋮ A branch-and-price algorithm for capacitated hypergraph vertex separation ⋮ Clique Cover and Graph Separation ⋮ Elements of Fuzzy Logic in Solving Clustering Problems ⋮ Edge-clique covers of the tensor product ⋮ Forbidden induced subgraphs for bounded \(p\)-intersection number ⋮ Constructing an indeterminate string from its associated graph ⋮ Complexity of representation of graphs by set systems ⋮ Unnamed Item ⋮ Hardness results for covering arrays avoiding forbidden edges and error-locating arrays ⋮ ModelingK-coteries by well-covered graphs ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Edge-clique graphs ⋮ The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures ⋮ On the kernel size of clique cover reductions for random intersection graphs ⋮ Bandwidth of graphs resulting from the edge clique covering problem ⋮ Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling ⋮ Unique intersectability of diamond-free graphs ⋮ Bounds for the completely positive rank of a symmetric matrix over a tropical semiring ⋮ Fast constructive and improvement heuristics for edge clique covering ⋮ On the complexity of directed intersection representation of DAGs ⋮ Unnamed Item ⋮ On the complete width and edge clique cover problems ⋮ On the triangle clique cover and \(K_t\) clique cover problems ⋮ Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem ⋮ Recognizing edge clique graphs among interval graphs and probe interval graphs ⋮ \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation ⋮ Large-scale clique cover of real-world networks ⋮ Редукция графа при поиске реберного покрытия минимальным числом клик ⋮ Hardness and structural results for half-squares of restricted tree convex bipartite graphs ⋮ Algorithms for compact letter displays: comparison and evaluation ⋮ Phylogeny numbers ⋮ Three-quarter approximation for the number of unused colors in graph coloring ⋮ Recognizing graphs with fixed interval number is NP-complete ⋮ Differential approximation algorithms for some combinatorial optimization problems ⋮ Applications of edge coverings by cliques ⋮ Covering arrays avoiding forbidden edges ⋮ Unnamed Item ⋮ On clique covers and independence numbers of graphs ⋮ Unnamed Item ⋮ A characterization of competition graphs of arbitrary digraphs ⋮ On the Computation of the Competition Number of a Graph ⋮ A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs ⋮ Approximation results for the minimum graph coloring problem

This page was built for publication: Covering edges by cliques with regard to keyword conflicts and intersection graphs