An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
From MaRDI portal
Publication:1123622
DOI10.1016/0020-0190(89)90220-2zbMath0677.68056MaRDI QIDQ1123622
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90220-2
bipartite graphs; maximum weight clique problem; maximum weight clique algorithm; maximum weight independent sets
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
05C38: Paths and cycles
Related Items
Distributed algorithms for maximum cliques, Two remarks on circular arc graphs, Efficient parallel recognition of some circular arc graphs. I