SNODP paper

social Network Diffusion Optimization Problem

(SNDOP) queries

differ from queries studied in the past in quantitative (both probabilistic and annotated) logic programming in

two fundamental ways:

(i)They are specialized to operate on graph data where the graph’s vertices and edges are labeled with properties and where the edges can have associated weights,

(ii)They find sets of vertices that optimize complex objective functions that can be specified by the user.

—————————–

Jackson

and Yariv 2005; Kempe et al. 2003] who often do not consider either edge or vert or edge weights through the function  w; it is well-known in marketing that intrinsic properties of vertices (customers, patients) and the nature and strength of the relationships (edges) is critical for decision making in those fields.

————————————