论文信息 - Coverings and Minors: Application to Local Computations in Graphs - 字舞流文

Coverings and Minors: Application to Local Computations in Graphs

Using the notion of covering, we prove that a minor-closed class of graphs cannot be recognized by local computations, except in a few special cases.

Bruno Courcelle | Yves Métivier | B. Courcelle | Y. Métivier

[1] K. Reidemeister. Einführung in die kombinatorische Topologie , 1951 .

[2] Jean Berstel,et al. Résolution, par un réseau d'automates, du problème des arborescences dans un graphe , 1967 .

[3] C. Berge. Graphes et hypergraphes , 1970 .

[4] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[5] Dana Angluin,et al. Finite common coverings of pairs of regular graphs , 1981, J. Comb. Theory B.

[6] Frank Thomson Leighton,et al. Finite common coverings of graphs , 1982, J. Comb. Theory, Ser. B.

[7] Paul D. Seymour,et al. Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[8] Paul D. Seymour,et al. Graph minors. VII. Disjoint paths on a surface , 1988, J. Comb. Theory, Ser. B.

[9] Michel Billaud,et al. Graph Rewriting Systems with Priorities , 1989, WG.

[10] Yves Métivier,et al. Computing with Graph Relabelling Systems with Priorities , 1990, Graph-Grammars and Their Application to Computer Science.

[11] Wolfgang Thomas. On Logics, Tilings, and Automata , 1991, ICALP.

[12] Yves Métivier,et al. The Power and the Limitations of Local Computations on Graphs , 1992, WG.

[13] Yves Métivier,et al. Definitions and Comparisons of Local Computations on Graphs , 1992, MFCS.