WG 2009 International Workshop on Graph-Theoretic Concepts in Computer Science
 |  |
Wall of Fame | Most Viewed WG-2009 Paper
WG
2009
Springer
14 years 7 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
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 |  | 153 | ||
| 2 | | 146 | ||
| 3 | | 136 | ||
| 4 | | 120 | ||
| 5 | | 117 | ||
| 6 | | 110 | ||
| 7 | | 108 | ||
| 8 | | 108 | ||
| 9 | | 108 | ||
| 10 | | 99 | ||
| 11 | | 99 | ||
| 12 | | 99 | ||
| 13 | | 97 | ||
| 14 | | 94 | ||
| 15 | | 90 | ||
| 16 | | 81 | ||
| 17 | | 71 | ||
| 18 | | 70 |