FAW 2009 International Workshop on Frontiers in Algorithmics
 |  |
Wall of Fame | Most Viewed FAW-2009 Paper
FAW
2009
Springer
14 years 6 months ago
2009
Springer
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 ...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 180 | ||
| 2 | | 178 | ||
| 3 | | 177 | ||
| 4 | | 144 | ||
| 5 | | 134 | ||
| 6 | | 118 |