Skip to main content
Article thumbnail
Location of Repository

Algorithms for square-3PC(·, ·)-free Berge graphs

By F. Maffray, N. Trotignon and K. Vuskovic


We consider the class of graphs containing no odd hole, no odd antihole, and no configuration consisting of three paths between two nodes such that any two of the paths\ud induce a hole, and at least two of the paths are of length 2. This class generalizes clawfree Berge graphs and square-free Berge graphs. We give a combinatorial algorithm of\ud complexity O(n7) to find a clique of maximum weight in such a graph. We also consider several subgraph-detection problems related to this class.\u

Publisher: Society for Industrial and Applied Mathematics
Year: 2008
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.