Pages that link to "Item:Q3449863"

The following pages link to Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863):

Displaying 18 items.

• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
• Identification of points using disks (Q1618247) (← links)
• Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
• On a conjecture regarding identification in Hamming graphs (Q2001977) (← links)
• Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
• The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
• Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
• The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
• Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
• Fast Diameter Computation within Split Graphs (Q5024674) (← links)
• Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
• Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
• Discriminating Codes in Geometric Setups (Q6065423) (← links)
• Neighbourhood complexity of graphs of bounded twin-width (Q6081102) (← links)
• A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
• Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)
• The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)