Shallow minor

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In graph theory, a shallow minor or limited-depth minor is a restricted form of a graph minor in which the subgraphs that are contracted to form the minor have small diameter. Shallow minors were introduced by Plotkin, Rao & Smith (1994), who attributed their invention to Charles E. Leiserson and Sivan Toledo.[1]

Definition[edit]

A graph that has the complete graph K4 as a 1-shallow minor. Each of the four vertex subsets indicated by the dashed rectangles induces a connected subgraph with radius one, and there exists an edge between every pair of subsets.

One way of defining a minor of an undirected graph G is by specifying a subgraph H of G, and a collection of disjoint subsets Si of the vertices of G, each of which forms a connected induced subgraph Hi of H. The minor has a vertex vi for each subset Si, and an edge vivj whenever there exists an edge from Si to Sj that belongs to H.

In this formulation, a d-shallow minor (alternatively called a shallow minor of depth d) is a minor that can be defined in such a way that each of the subgraphs Hi has radius at most d, meaning that it contains a central vertex ci that is within distance d of all the other vertices of Hi. Note that this distance is measured by hop count in Hi, and because of that it may be larger than the distance in G.[1]

Special cases[edit]

Shallow minors of depth zero are the same thing as subgraphs of the given graph. For sufficiently large values of d (including all values at least as large as the number of vertices), the d-shallow minors of a given graph coincide with all of its minors.[1]

Classification of graph families[edit]

Nešetřil & Ossona de Mendez (2012) use shallow minors to partition the families of finite graphs into two types. They say that a graph family F is somewhere dense if there exists a finite value of d for which the d-shallow minors of graphs in F consist of every finite graph. Otherwise, they say that a graph family is nowhere dense.[2] This terminology is justified by the fact that, if F is a nowhere dense class of graphs, then (for every ε > 0) the n-vertex graphs in F have O(n1 + ε) edges; thus, the nowhere dense graphs are sparse graphs.[3]

A more restrictive type of graph family, described similarly, are the graph families of bounded expansion. These are graph families for which there exists a function f such that the ratio of edges to vertices in every d-shallow minor is at most f(d).[4] If this function exists and is bounded by a polynomial, the graph family is said to have polynomial expansion.

Separator theorems[edit]

As Plotkin, Rao & Smith (1994) showed, graphs with excluded shallow minors can be partitioned analogously to the planar separator theorem for planar graphs. In particular, if the complete graph Kh is not a d-shallow minor of an n-vertex graph G, then there exists a subset S of G, with size O(dh2 log n + n/d), such that each connected component of G\S has at most 2n/3 vertices. The result is constructive: there exists a polynomial time algorithm that either finds such a separator, or a d-shallow Kh minor.[5] As a consequence they showed that every minor-closed graph family obeys a separator theorem almost as strong as the one for planar graphs.

Plotkin et al. also applied this result to the partitioning of finite element method meshes in higher dimensions; for this generalization, shallow minors are necessary, as (with no depth restriction) the family of meshes in three or more dimensions has all graphs as minors. Teng (1998) extends these results to a broader class of high-dimensional graphs.

More generally, a hereditary graph family has a separator theorem where the separator size is a sublinear power of n if and only if it has polynomial expansion.[6]

Notes[edit]

  1. ^ a b c Nešetřil & Ossona de Mendez (2012), Section 4.2 "Shallow Minors", pp. 62–65.
  2. ^ Nešetřil & Ossona de Mendez (2012), section 5.3 "Classification of Classes by Clique Minors", pp. 100–102.
  3. ^ Nešetřil & Ossona de Mendez (2012), Theorem 5.3, p. 100.
  4. ^ Nešetřil & Ossona de Mendez (2012), Section 5.5 "Classes with Bounded Expansion", pp. 104–107.
  5. ^ The algorithm of Plotkin et al. takes time O(mn/d), where m is the number of edges in the input. Wulff-Nilsen (2011) improved this for non-sparse graphs to O(m + n2 + ε/d).
  6. ^ Dvořák & Norin (2015).

References[edit]