The complexity of broadcasting in planar and decomposable graphs.

Andreas Jakoby Rüdiger Reischuk Christian Schindelhauer

Published in: Discret. Appl. Math. (1998)

Keyphrases

graph theoretic
np complete
space complexity
graph mining
planar graphs
data sets
image segmentation
computational complexity
pairwise
directed graph
weighted graph
ground plane
graph representation
representational power
polynomial time complexity