scientific article; zbMATH DE number 3891419

zbMATH Open0559.05049MaRDI QIDQ3347925FDOQ3347925

Author name not available (Why is that?)

Publication date: 1984

Title of this publication is not available (Why is that?)

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)

Cited In (3)

• Bibliography on domination in graphs and some basic definitions of domination parameters
• On a circle-cover minimization problem
• A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs

   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 👍 👎

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)