atlas

Research map / Graph learning / Knowledge and temporal graphs

Maximizing Influence Spread through a Dynamic Social Network (Student Abstract)

AAAI 2023 · Graph learning › Knowledge and temporal graphs · approach: Continuous-time dynamic graph learning · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Model Target Set Selection on temporal graphsTarget Set Selection · TEMP-TSS, generalcomputational complexityMixed
Allow the network to change over two time steps while all thresholds equal 1TEMP-TSS · TEMP-TSS, thresholds 1, lifetime 2computational complexityMixed
Use a complete underlying graph with thresholds at most 2TEMP-TSS · TEMP-TSS, complete underlying graphcomputational complexityMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy