The structure and number of global roundings of a graph.

Tetsuo Asano Naoki Katoh Hisao Tamaki Takeshi Tokuyama

Published in: Theor. Comput. Sci. (2004)

Keyphrases

small number
maximum number
computational complexity
fixed number
graph representation
genetic algorithm
case study
bayesian networks
np complete
random walk
structural information
structural properties
graph structure
graph model
graph theoretic