On the Complexity of the Storyplan Problem

by   Carla Binucci, et al.

Motivated by dynamic graph visualization, we study the problem of representing a graph G in the form of a storyplan, that is, a sequence of frames with the following properties. Each frame is a planar drawing of the subgraph of G induced by a suitably defined subset of its vertices. Between two consecutive frames, a new vertex appears while some other vertices may disappear, namely those whose incident edges have already been drawn in at least one frame. In a storyplan, each vertex appears and disappears exactly once. For a vertex (edge) visible in a sequence of consecutive frames, the point (curve) representing it does not change throughout the sequence. Note that the order in which the vertices of G appear in the sequence of frames is a total order. In the StoryPlan problem, we are given a graph and we want to decide whether there exists a total order of its vertices for which a storyplan exists. We prove that the problem is NP-complete, and complement this hardness with two parameterized algorithms, one in the vertex cover number and one in the feedback edge set number of G. Also, we prove that partial 3-trees always admit a storyplan, which can be computed in linear time. Finally, we show that the problem remains NP-complete in the case in which the total order of the vertices is given as part of the input and we have to choose how to draw the frames.


page 1

page 2

page 3

page 4


Defensive Alliances in Graphs

A set S of vertices of a graph is a defensive alliance if, for each elem...

Parameterized Complexity of Simultaneous Planarity

Given k input graphs G_1, … ,G_k, where each pair G_i, G_j with i ≠ j sh...

Computing Hive Plots: A Combinatorial Framework

Hive plots are a graph visualization style placing vertices on a set of ...

Parameterized Algorithms for Red-Blue Weighted Vertex Cover on Trees

Weighted Vertex Cover is a variation of an extensively studied NP-comple...

Small Point-Sets Supporting Graph Stories

In a graph story the vertices enter a graph one at a time and each verte...

Reconfiguration of Connected Graph Partitions

Motivated by recent computational models for redistricting and detection...

Turning Cliques into Paths to Achieve Planarity

Motivated by hybrid graph representations, we introduce and study the fo...

Please sign up or login with your details

Forgot password? Click here to reset