Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
From MaRDI portal
Publication:3683548
DOI10.1137/0214018zbMath0567.68042OpenAlexW2025641440MaRDI QIDQ3683548
No author found.
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214018
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Computing the all-pairs longest chains in the plane, Finding maximum cliques on circular-arc graphs, Maximum weight independent set of circular-arc graph and its application, Algorithmic aspects of intersection graphs and representation hypergraphs, On Strict (Outer-)Confluent Graphs, An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs, On powers of circular arc graphs and proper circular arc graphs, A Faster Algorithm for Maximum Induced Matchings on Circle Graphs, Extending partial representations of circular-arc graphs, Combinatorial problems on \(H\)-graphs, On strict (outer-)confluent graphs, A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle, A Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints, Representations of graphs and networks (coding, layouts and embeddings), New clique and independent set algorithms for circle graphs, List matrix partitions of graphs representing geometric configurations, Two remarks on circular arc graphs, Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs, Parallel algorithms on circular-arc graphs, A branch and bound algorithm for the maximum clique problem, Efficient parallel recognition of some circular arc graphs. I, On \(H\)-topological intersection graphs, Optimal parallel algorithms on circular-arc graphs, Hadwiger's conjecture for proper circular arc graphs, OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS, Efficient reduction for path problems on circular-arc graphs, Parallel algorithms for permutation graphs, The maximum clique problem, The maximum clique problem in multiple interval graphs, Fast distance multiplication of unit-Monge matrices
