Finding maximum cliques on circular-arc graphs
From MaRDI portal
Publication:1108807
DOI10.1016/0020-0190(87)90007-XzbMath0654.68082MaRDI QIDQ1108807
Alberto Apostolico, Susanne E. Hambrusch
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Two remarks on circular arc graphs, A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle, An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs, Efficient parallel recognition of some circular arc graphs. I, Paths in interval graphs and circular arc graphs, Optimal parallel algorithms on circular-arc graphs
Cites Work