Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs
From MaRDI portal
Publication:3614194
DOI10.1137/050628520zbMath1165.68056arXiv1309.0694WikidataQ59903865 ScholiaQ59903865MaRDI QIDQ3614194
Frédéric Maffray, Kristina Vušković, Nicolas Trotignon
Publication date: 16 March 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.0694
perfect graphs; combinatorial algorithms; recognition algorithm; star decomposition; maximum weight clique algorithm
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
90C27: Combinatorial optimization
05C85: Graph algorithms (graph-theoretic aspects)
05C17: Perfect graphs
Related Items
The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs, Detecting induced subgraphs, On the forbidden induced subgraph sandwich problem, The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs, Vertex elimination orderings for hereditary graph classes