On Maximal Chain Subgraphs and Covers of Bipartite Graphs
In this paper, we address three related problems. One is the enumeration of all the maximal edge induced chain subgraphs of a bipartite graph, for which we provide a polynomial delay algorithm. We give bounds on the number of maximal chain subgraphs for a bipartite graph and use them to establish the input-sensitive complexity of the enumeration problem. The second problem we treat is the one of finding the minimum number of chain subgraphs needed to cover all the edges a bipartite graph. For this we provide an exact exponential algorithm with a non trivial complexity. Finally, we approach the problem of enumerating all minimal chain subgraph covers of a bipartite graph and show that it can be solved in quasi-polynomial time.
KeywordsChain subgraph cover problem Enumeration algorithms Exact exponential algorithms
- 8.Fedor, V.: Fomin and Dieter Kratsch. Exact Exponential Algorithms. Springer-Verlag New York Inc, New York, NY, USA (2010)Google Scholar