FAW   2009 International Workshop on Frontiers in Algorithmics
Wall of Fame | Most Viewed FAW-2009 Paper
180views Algorithms» more  FAW 2009»
12 years 10 months ago
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 ...
Pinar Heggernes, Rodica Mihai
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source180
2Download preprint from source178
3Download preprint from source177
4Download preprint from source144
5Download preprint from source134
6Download preprint from source118