A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs

Given an n -vertex digraph D and a non-negative integer k , the M inimum D irected B isection problem asks if the vertices of D can be partitioned into two parts, say L and R , such that | L | and | R | differ by at most 1 and the number of arcs from R to L is at most k . This problem is known to be...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 83; no. 6; pp. 1861 - 1884
Main Authors:	Madathil, Jayakrishnan, Sharma, Roohani, Zehavi, Meirav
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2021 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Kernels Mathematics of Computing Polynomials Theory of Computation Bisection Polynomial kernel Splitters FPT Algorithm Chromatic coding Semicomplete digraph Tournament
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!