Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs.

Ludek Kucera Jaroslav Nesetril Ales Pultr

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

Keyphrases

weighted graph
worst case
vapnik chervonenkis dimension
bayesian networks
data structure
edge detection
closely related
graph matching
graph theory
space complexity
graph theoretic
graphical models
edge information
undirected graph
approximation error