Pages that link to "Item:Q1186160"
From MaRDI portal
The following pages link to An optimal algorithm for finding dominating cycles in circular-arc graphs (Q1186160):
Displaying 4 items.
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Improved algorithms and complexity results for power domination in graphs (Q958210) (← links)
- Paths in interval graphs and circular arc graphs (Q1210553) (← links)
- A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs (Q1950396) (← links)
