scientific article; zbMATH DE number 3891419
From MaRDI portal
Publication:3347925
zbMATH Open0559.05049MaRDI QIDQ3347925FDOQ3347925
Authors:
Publication date: 1984
Title of this publication is not available (Why is that?)
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
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (9)
- 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
- 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)
