Randomly removing g handles at once
From MaRDI portal
Publication:991176
DOI10.1016/J.COMGEO.2010.04.007zbMATH Open1207.05038OpenAlexW2570869342MaRDI QIDQ991176FDOQ991176
Authors: Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos 
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
Recommendations
- Randomly removing \(g\) handles at once
- Random triangle removal
- Removing independently even crossings
- Removing Independently Even Crossings
- Random sampling with removal
- Random sampling with removal
- On deleting coordinates from integer vectors
- Deletion along trajectories
- Random marginal and random removal values
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Cites Work
- Extending Lipschitz functions via random metric partitions
- Graphs on surfaces
- Approximation algorithms for NP-complete problems on planar graphs
- Title not available (Why is that?)
- A tight bound on approximating arbitrary metrics by tree metrics
- Excluded minors, network decomposition, and multicommodity flow
- Cuts, trees and \(\ell_1\)-embeddings of graphs
- Optimally cutting a surface into a disk
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- On the geometry of graphs with a forbidden minor
- Probabilistic embeddings of bounded genus graphs into planar graphs
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Algorithms – ESA 2004
Cited In (5)
This page was built for publication: Randomly removing \(g\) handles at once
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991176)
