Pages that link to "Item:Q1364472"

The following pages link to The VC-dimension of set systems defined by graphs (Q1364472):

Displaying 10 items.

• The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
• The cycle discrepancy of three-regular graphs (Q659662) (← links)
• Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
• Fast approximation of betweenness centrality through sampling (Q1741154) (← links)
• Bounded \(VC\)-dimension implies the Schur-Erdős conjecture (Q2064760) (← links)
• Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
• Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
• Erdős-Hajnal conjecture for graphs with bounded VC-dimension (Q2415381) (← links)
• Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
• On the VC-dimension‎, ‎covering and separating properties of the cycle and spanning tree hypergraphs of graphs (Q5103874) (← links)