Pages that link to "Item:Q963384"
From MaRDI portal
The following pages link to Minimum weight feedback vertex sets in circle graphs (Q963384):
Displaying 10 items.
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs (Q286981) (← links)
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- Parameterized domination in circle graphs (Q2441539) (← links)
- Minimum weight feedback vertex sets in circle \(n\)-gon graphs and circle trapezoid graphs (Q2890989) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)