scientific article; zbMATH DE number 3891419

MaRDI QIDQ3347925zbMATH OpenFDO

Authors

Publication date 1984

zbMATH Keywords

algorithmscircular-arc graphsCircle graphsmaximum weight cliques

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
• 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
• New clique and independent set algorithms for circle graphs
• Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications

Cited in

(10)

• Finding maximum cliques on circular-arc graphs
• An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
• On a circle placement problem
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Clique-coloring circular-arc graphs
• A maximum weight clique algorithm for dense circle graphs with many shared endpoints
• Algorithms and Computation
• On a circle-cover minimization problem
• Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
• A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs

This page was built for publication:

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