Pages that link to "Item:Q4881292"
From MaRDI portal
The following pages link to A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs (Q4881292):
Displaying 9 items.
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- An O(qn) algorithm to q-color a proper family of circular arcs (Q1060020) (← links)
- A classification of locally semicomplete digraphs (Q1356448) (← links)
- Clique-coloring circular-arc graphs (Q2840551) (← links)
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
- Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)