Grid Minors in Damaged Grids
Copyright policy )Grid Minors in Damaged Grids
We prove upper and lower bounds on the size of the largest square grid graph that is a subgraph, minor, or shallow minor of a graph in the form of a larger square grid from which a specified number of vertices have been deleted. Our bounds are tight to within constant factors. We also provide less-tight bounds on analogous problems for higher-dimensional grids.
- University of California, San Francisco United States
- University of California, Irvine United States
- University of California System United States
FOS: Computer and information sciences, grid graphs, Distance in graphs, shallow minors, Discrete Mathematics (cs.DM), subgraphs, Graph minors, G.2.2, treewidth, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), graph minors, vertex deletion, Computer Science - Discrete Mathematics
FOS: Computer and information sciences, grid graphs, Distance in graphs, shallow minors, Discrete Mathematics (cs.DM), subgraphs, Graph minors, G.2.2, treewidth, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), graph minors, vertex deletion, Computer Science - Discrete Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!