Pages that link to "Item:Q6089667"
From MaRDI portal
The following pages link to Parameterized Complexity of Geodetic Set (Q6089667):
Displaying 10 items.
- Geometric complexity of some location problems (Q1099951) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- Block decomposition approach to compute a minimum geodetic set (Q2928426) (← links)
- Monitoring the edges of a graph using distances (Q5896103) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- (Q6065396) (← links)
- On graphs coverable by \({k}\) shortest paths (Q6561322) (← links)