A superclass of Edge-Path-Tree graphs with few cliques

A superclass of Edge-Path-Tree graphs with few cliques

0.00 Avg rating0 Votes
Article ID: iaor20102989
Volume: 37
Issue: 5
Start Page Number: 351
End Page Number: 355
Publication Date: Sep 2009
Journal: Operations Research Letters
Authors: ,
Abstract:

Edge-Path-Tree (EPT) graphs are intersection graphs of EPT matrices that is matrices whose columns are incidence vectors of edge-sets of paths in a given tree. EPT graphs have polynomially many cliques [M.C. Golumbic, R.E. Jamison (1985) C.L. Monma, V.K. Wey (1986)]. Therefore, the problem of finding a clique of maximum weight in these graphs is solvable in strongly polynomial time. We extend this result to a proper superclass of EPT graphs.

Reviews

Required fields are marked *. Your email address will not be published.