Randomly removing \(g\) handles at once

DOI10.1016/J.COMGEO.2010.04.007zbMath1207.05038OpenAlexW2570869342MaRDI QIDQ991176

Anastasios Sidiropoulos, James R. Lee, Glencora Borradaile

Publication date: 2 September 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.04.007

zbMATH Keywords

planar graphsgenusmetric embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Related Items (1)

Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cuts, trees and \(\ell_1\)-embeddings of graphs
• Optimally cutting a surface into a disk
• Extending Lipschitz functions via random metric partitions
• Approximation algorithms for NP-complete problems on planar graphs
• On the geometry of graphs with a forbidden minor
• Excluded minors, network decomposition, and multicommodity flow
• Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
• Algorithms – ESA 2004
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• A tight bound on approximating arbitrary metrics by tree metrics

This page was built for publication: Randomly removing \(g\) handles at once