Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs

DOI10.1137/0214018MaRDI QIDQ3683548zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3891419
• An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
• AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
• Finding maximum cliques on circular-arc graphs
• A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs

Cited in

(34)

• Hadwiger's conjecture for proper circular arc graphs
• Finding maximum cliques on circular-arc graphs
• An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
• Computing the all-pairs longest chains in the plane
• The maximum clique problem
• List matrix partitions of graphs representing geometric configurations
• Combinatorial problems on \(H\)-graphs
• On strict (outer-)confluent graphs
• On strict (outer-)confluent graphs
• New clique and independent set algorithms for circle graphs
• A branch and bound algorithm for the maximum clique problem
• A Faster Algorithm for Maximum Induced Matchings on Circle Graphs
• On a circle placement problem
• On \(H\)-topological intersection graphs
• Parallel algorithms on circular-arc graphs
• On powers of circular arc graphs and proper circular arc graphs
• Optimal parallel algorithms on circular-arc 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
• Fast distance multiplication of unit-Monge matrices
• OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS
• Parallel algorithms for permutation graphs
• Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
• scientific article; zbMATH DE number 3891419 (Why is no real title available?)
• Two remarks on circular arc graphs
• The maximum clique problem in multiple interval graphs
• Algorithmic aspects of intersection graphs and representation hypergraphs
• Finding cliques of maximum weight on a generalization of permutation graphs
• A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
• Extending partial representations of circular-arc graphs
• Maximum weight independent set of circular-arc graph and its application
• Efficient parallel recognition of some circular arc graphs. I
• Efficient reduction for path problems on circular-arc graphs
• Representations of graphs and networks (coding, layouts and embeddings)

This page was built for publication: Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683548)