Vertex cuts, random walks, and dimension reduction in series-parallel graphs
From MaRDI portal
Publication:3549664
DOI10.1145/1250790.1250882zbMath1232.68163WikidataQ58198039 ScholiaQ58198039MaRDI QIDQ3549664
James R. Lee, Bo Brinkman, Adriana Karagiozova
Publication date: 5 January 2009
Published in: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1250790.1250882
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Markov type and threshold embeddings, Metric characterizations of superreflexivity in terms of word hyperbolic groups and finite graphs, Coarse differentiation and multi-flows in planar graphs, An introduction to the Ribe program, Spectral calculus and Lipschitz extension for barycentric metric spaces