Pages that link to "Item:Q911283"
From MaRDI portal
The following pages link to A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283):
Displaying 9 items.
- A parallel algorithm for solving the coloring problem on trapezoid graphs (Q287107) (← links)
- Finding maximum cliques on circular-arc graphs (Q1108807) (← links)
- A parallel circle-cover minimization algorithm (Q1823682) (← links)
- (Q2779605) (← links)
- Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search (Q3060200) (← links)
- AN IMPROVED PARALLEL ALGORITHM FOR A GEOMETRIC MATCHING PROBLEM WITH APPLICATION TO TRAPEZOID GRAPHS (Q3150028) (← links)
- (Q3561694) (← links)
- Distributed algorithms for maximum cliques (Q4338575) (← links)
- A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs (Q4881292) (← links)