scientific article
From MaRDI portal
Publication:4016827
zbMath0767.05073MaRDI QIDQ4016827
Publication date: 16 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (9)
An overview of graph covering and partitioning ⋮ Known Algorithms for Edge Clique Cover are Probably Optimal ⋮ Clique Cover and Graph Separation ⋮ Edge-clique covers of the tensor product ⋮ On the kernel size of clique cover reductions for random intersection graphs ⋮ Edge clique partition in \((k,\ell)\)-graphs ⋮ Fast constructive and improvement heuristics for edge clique covering ⋮ On the complete width and edge clique cover problems ⋮ Large-scale clique cover of real-world networks
This page was built for publication:
