Login / Signup

Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph.

Nabil KahaléLeonard J. Schulman
Published in: Comb. (1996)
Keyphrases
  • connected graphs
  • color images
  • upper bound
  • image processing
  • clustering algorithm
  • bayesian networks
  • computational complexity
  • random walk
  • connected components
  • human perception
  • maximum number
  • graph representation