Publication:4448745
From MaRDI portal
zbMath1042.68620MaRDI QIDQ4448745
Publication date: 18 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040044.htm
68R10: Graph theory (including graph drawing) in computer science
Related Items
On the kernel size of clique cover reductions for random intersection graphs, On the complete width and edge clique cover problems, Clique Cover and Graph Separation, Known Algorithms for Edge Clique Cover are Probably Optimal