Pages that link to "Item:Q1123622"
From MaRDI portal
The following pages link to An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622):
Displaying 9 items.
- Two remarks on circular arc graphs (Q675889) (← links)
- Maximum weight independent set of circular-arc graph and its application (Q861467) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526) (← links)
- Perfect circular arc coloring (Q2569164) (← links)
- On cliques of Helly Circular-arc Graphs (Q3503539) (← links)
- Distributed algorithms for maximum cliques (Q4338575) (← links)
- Parallel algorithms on circular-arc graphs (Q5899761) (← links)
