Edge Search Number of Cographs in Linear Time

We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our result, the knowledge on graph searching of cographs is now complete: node, mixed, and edge search numbers of cographs can all be computed efficiently. Furthermore, we are one step closer to computing the edge search number of permutation graphs.

• Type: Conference
• Year: 2009
• Where: FAW
• Authors: Pinar Heggernes, Rodica Mihai
• Keywords: Algorithms, Edge Search Number, FAW 2009, Graph Class, Graph Searching