Clan embeddings into trees, and low treewidth graphs

DOI10.1145/3406325.3451043arXiv2101.01146OpenAlexW3169175672MaRDI QIDQ6087006

Arnold Filtser, Hung Le

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.01146

zbMATH Keywords

treewidthmetric embeddingsminor-free graphsclan embeddingcompact routhing schememetric \(\rho\)-dominating setmetric \(\rho\)-isolated setRamsey type embedding

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Light spanners for high dimensional norms via stochastic decompositions

This page was built for publication: Clan embeddings into trees, and low treewidth graphs