Fundamentals of Computation Theory
From MaRDI portal
Publication:5492956
DOI10.1007/11537311zbMath1122.68478OpenAlexW2491671784MaRDI QIDQ5492956
Suhail Mahfud, Andreas Brandstädt, Van Bang Le
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11537311
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs ⋮ On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
This page was built for publication: Fundamentals of Computation Theory
