Sparsity and dimension
From MaRDI portal
Publication:4575709
DOI10.1137/1.9781611974331.CH125zbMATH Open1410.05111OpenAlexW4251162746MaRDI QIDQ4575709FDOQ4575709
Authors: Gwenaël Joret, Piotr Micek, Veit Wiechert
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch125
Recommendations
Density (toughness, etc.) (05C42) Structural characterization of families of graphs (05C75) Combinatorics of partially ordered sets (06A07)
Cited In (14)
- Title not available (Why is that?)
- Statistical sparsity
- Nowhere dense graph classes and dimension
- Planar Posets Have Dimension at Most Linear in Their Height
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond
- Dimensionality reduction for regularization of sparse data-driven RANS simulations
- Cover graphs and order dimension
- Minors and dimension
- Sparse Rational Univariate Representation
- Topological minors of cover graphs and dimension
- On the dimension of posets with cover graphs of treewidth 2
- Boolean dimension and local dimension
- Dimension of posets with planar cover graphs excluding two long incomparable chains
- Sparsity and dimension
This page was built for publication: Sparsity and dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575709)