Name
Abstract | ||
|---|---|---|
We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian cycle of G. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0020-0190(03)00298-9 | Inf. Process. Lett. |
Keywords | DocType | Volume |
biconnected proper interval graph,linear time algorithm,linear time recognition algorithm,hamiltonian cycle,bicompatible elimination,proper interval graph,linear time,algorithms,chordal graph,interval graph | Journal | 87 |
Issue | ISSN | Citations |
3 | 0020-0190 | 26 |
PageRank | References | Authors |
1.29 | 21 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| B. S. Panda | 1 | 99 | 21.18 |
| Sajal K. Das | 2 | 8086 | 745.54 |