论文信息 - Legal coloring of graphs

Legal coloring of graphs

The following computational problem was initiated by Manber and Tompa (22nd FOCS Conference, 1981): Given a graphG=(V, E) and a real functionf:V→R which is a proposed vertex coloring. Decide whetherf is a proper vertex coloring ofG. The elementary steps are taken to be linear comparisons.Lower bounds on the complexity of this problem are derived using the chromatic polynomial ofG. It is shown how geometric parameters of a space partition associated withG influence the complexity of this problem.Existing methods for analyzing such space partitions are suggested as a powerful tool for establishing lower bounds for a variety of computational problems.

Nathan Linial

[1] Andrew Chi-Chih Yao,et al. On the Polyhedral Decision Problem , 1980, SIAM J. Comput..

[2] Marc Snir,et al. Proving Lower Bounds for Linar Decision Trees , 1981, International Colloquium on Automata, Languages and Programming.

[3] T. Zaslavsky. Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .

[4] Richard P. Stanley. Acyclic orientations of graphs , 1973, Discret. Math..

[5] Andrew Chi-Chih Yao,et al. Information Bounds Are Weak in the Shortest Distance Problem , 1980, JACM.

[6] Richard J. Lipton,et al. On the Complexity of Computations under Varying Sets of Primitives , 1975, J. Comput. Syst. Sci..

[7] Udi Manber,et al. The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem , 1981, FOCS.

[8] Thomas Zaslavsky,et al. The Geometry of Root Systems and Signed Graphs , 1981 .