A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs
[article]
2018
arXiv
pre-print
A graph G is a (Π_A,Π_B)-graph if V(G) can be bipartitioned into A and B such that G[A] satisfies property Π_A and G[B] satisfies property Π_B. The (Π_A,Π_B)-Recognition problem is to recognize whether a given graph is a (Π_A,Π_B)-graph. There are many (Π_A,Π_B)-Recognition problems, including the recognition problems for bipartite, split, and unipolar graphs. We present efficient algorithms for many cases of (Π_A,Π_B)-Recognition based on a technique which we dub inductive recognition. In
arXiv:1702.04322v2
fatcat:iv2zl54wrzadfa7dx3d4rpcuuq