An FPT Algorithm for Bipartite Vertex Splitting

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