This is the latest version of this eprint.
Maffrey, F, Trotignon, N and Vuskovic, K (2008) Algorithms for square-3PC($\cdot, \cdot$)-free Berge graphs. SIAM Journal on Discrete Mathematics, 22 (1). 51 - 71 . ISSN 0895-4801
Abstract
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 induce a hole, and at least two of the paths are of length 2. This class generalizes claw-free Berge graphs and square-free Berge graphs. We give a combinatorial algorithm of complexity $O(n^{7})$ to find a clique of maximum weight in such a graph. We also consider several subgraph-detection problems related to this class.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Mrs Irene Rudling |
Date Deposited: | 22 Oct 2012 13:01 |
Last Modified: | 16 Sep 2016 14:18 |
Published Version: | http://dx.doi.org/10.1137/050628520 |
Status: | Published |
Publisher: | Society for Industrial and Applied Mathematics |
Refereed: | Yes |
Identification Number: | 10.1137/050628520 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:74366 |
Available Versions of this Item
-
Algorithms for square-3PC(·, ·)-free Berge graphs. (deposited 05 Mar 2009 18:39)
- Algorithms for square-3PC($\cdot, \cdot$)-free Berge graphs. (deposited 22 Oct 2012 13:01) [Currently Displayed]