An FPT Algorithm for Bipartite Vertex Splitting

08/27/2022
by   Reyan Ahmed, et al.
0

Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set of objects is visualized as a set of vertices (points) on one of the two parallel horizontal lines and the relationships are represented by edges (simple curves) between the two lines connecting the corresponding vertices. One of the common objectives in such drawings is to minimize the number of crossings this, however, is computationally expensive and may still result in drawings with so many crossings that they affect the readability of the drawing. We consider a recent approach to remove crossings in such visualizations by splitting vertices, where the goal is to find the minimum number of vertices to be split to obtain a planar drawing. We show that determining whether a planar drawing exists after splitting at most k vertices is fixed parameter tractable in k.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/25/2023

Splitting Vertices in 2-Layer Graph Drawings

Bipartite graphs model the relationships between two disjoint sets of en...
research
02/24/2022

Planarizing Graphs and their Drawings by Vertex Splitting

The splitting number of a graph G=(V,E) is the minimum number of vertex ...
research
03/12/2019

Cubic Planar Graphs that cannot be Drawn on few Lines

For every integer ℓ, we construct a cubic 3-vertex-connected planar bipa...
research
03/03/2020

Procedural band patterns

We seek to cover a parametric domain with a set of evenly spaced bands w...
research
03/06/2021

An Effective Approach to Minimize Error in Midpoint Ellipse Drawing Algorithm

The present paper deals with the generalization of Midpoint Ellipse Draw...
research
12/30/2021

Weaving patterns inspired by the pentagon snub subdivision scheme

Various computer simulations regarding, e.g., the weather or structural ...
research
10/17/2020

RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs

Tip decomposition is a crucial kernel for mining dense subgraphs in bipa...

Please sign up or login with your details

Forgot password? Click here to reset