Pages that link to "Item:Q264186"
From MaRDI portal
The following pages link to A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186):
Displaying 6 items.
- A new graph parameter to measure linearity (Q1708605) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
- On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
- Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
