Pages that link to "Item:Q419416"
From MaRDI portal
The following pages link to Sparsity. Graphs, structures, and algorithms (Q419416):
Displaying 50 items.
- Efficient data structures for sparse network representation (Q3523690) (← links)
- Metrics for sparse graphs (Q3656241) (← links)
- (Q4230327) (← links)
- Edge Exchangeable Models for Interaction Networks (Q4559710) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- The Effect of Planarization on Width (Q4625143) (← links)
- (Q4625695) (← links)
- Completeness for First-order Properties on Sparse Structures with Algorithmic Applications (Q4629991) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- (Q4638077) (← links)
- NEW SPARSENESS RESULTS ON GRAPH SPANNERS (Q4698355) (← links)
- Scattered Classes of Graphs (Q4959761) (← links)
- The Effect of Planarization on Width (Q4961755) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
- First order limits of sparse graphs: Plane trees and path-width (Q4978432) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
- Improved Bounds for the Excluded-Minor Approximation of Treedepth (Q4990393) (← links)
- Recovering sparse graphs (Q5005129) (← links)
- Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611) (← links)
- Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
- Action convergence of operators and graphs (Q5029489) (← links)
- Parameterized Complexity of $$(A,\ell )$$-Path Packing (Q5041178) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
- Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
- Parameterized Complexity of Geodetic Set (Q5050005) (← links)
- Twin-width II: small classes (Q5051371) (← links)
- Harary polynomials (Q5056203) (← links)
- (Q5075772) (← links)
- (Q5075776) (← links)
- Random 2-cell embeddings of multistars (Q5086920) (← links)
- Elimination Distance to Bounded Degree on Planar Graphs (Q5089238) (← links)
- (Q5090476) (← links)
- (Q5090494) (← links)
- On the Parameterized Complexity of [1,j]-Domination Problems (Q5090974) (← links)
- Planar Maximum Matching: Towards a Parallel Algorithm (Q5091011) (← links)
- (Q5091230) (← links)
- (Q5092394) (← links)
- (Q5092402) (← links)
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth (Q5108706) (← links)
- (Q5111296) (← links)
- Subexponential parameterized algorithms for graphs of polynomial growth (Q5111748) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs (Q5111869) (← links)
- Optimality of geometric local search (Q5115816) (← links)
- (Q5116487) (← links)
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness (Q5140724) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- Obstructions for Bounded Branch-depth in Matroids (Q5162868) (← links)