First Page | Document Content | |
---|---|---|
![]() Date: 2009-08-17 16:30:24Interval graph Chordal graph Indifference graph Perfect graph Independent set Circular-arc graph Clique Interval Adjacency matrix Graph Representation Pathwidth | Add to Reading List |
![]() | Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/damDocID: 1qr87 - View Document |
![]() | Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial TimeDocID: 1pIzb - View Document |
![]() | doi:j.amlDocID: 1pbNL - View Document |