Pages that link to "Item:Q2827829"
From MaRDI portal
The following pages link to Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829):
Displaying 10 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- Edge monitoring problem on interval graphs (Q510622) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Computing a metric basis of a bipartite distance-hereditary graph (Q2062127) (← links)
- Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
- Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
- Computing a metric basis of a 2-connected bipartite distance-hereditary graph (Q2283041) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Metric Dimension of Bounded Tree-length Graphs (Q5268001) (← links)