scientific article; zbMATH DE number 2044920

zbMath1042.68620MaRDI QIDQ4448745

Haiko Müller, Maw-Shang Chang

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040044.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

An overview of graph covering and partitioning ⋮ Known Algorithms for Edge Clique Cover are Probably Optimal ⋮ Clique Cover and Graph Separation ⋮ On the kernel size of clique cover reductions for random intersection graphs ⋮ Unnamed Item ⋮ On the complete width and edge clique cover problems ⋮ Large-scale clique cover of real-world networks