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

There is a more recent version of this eprint available. Click here to view it.

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 clawfree Berge graphs and square-free Berge graphs. We give a combinatorial algorithm of 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.

Metadata

Authors/Creators:	Maffray, F. Trotignon, N. Vuskovic, K.
Copyright, Publisher and Additional Information:	© 2008 Society for Industrial and Applied Mathematics. Reproduced in accordance with the publisher's self-archiving policy.
Keywords:	recognition algorithm, maximum weight clique algorithm, combinatorial algorithms, perfect graphs, star decompositions
Dates:	Published: February 2008
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:	05 Mar 2009 18:39
Last Modified:	08 Feb 2013 16:57
Published Version:	http://dx.doi.org/10.1137/050628520
Status:	Published
Publisher:	Society for Industrial and Applied Mathematics
Refereed:	Yes
Identification Number:	https://doi.org/10.1137/050628520

Available Versions of this Item

Algorithms for square-3PC(·, ·)-free Berge graphs. (deposited 05 Mar 2009 18:39) [Currently Displayed]
- Algorithms for square-3PC($\cdot, \cdot$)-free Berge graphs. (deposited 22 Oct 2012 13:01)

CORE (COnnecting REpositories)

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

Abstract

Metadata

Available Versions of this Item

Download

KV3pc-square

Export

Statistics