LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P6-FREE GRAPHS
2003 ◽
Vol 14
(01)
◽
pp. 107-136
◽
Keyword(s):
In [7] was introduced a new decomposition scheme for bipartite graphs that was called canonical decomposition. Weak-bisplit graphs are totally decomposable following this decomposition. We give here linear time algorithms for the recognition of weak-bisplit graphs as well as for two subclasses of this class, the P6-free bipartite graphs and the bi-cographs. Our algorithms extends the technics developped in [2] for cographs's recognition. We conclude by presenting efficient solutions for some optimization problems when dealing with weak-bisplit graphs.
Keyword(s):
1999 ◽
Vol 10
(04)
◽
pp. 513-533
◽
1999 ◽
Vol 37
(4-5)
◽
pp. 199-208
1996 ◽
Vol 06
(01)
◽
pp. 127-136
◽
Keyword(s):
2011 ◽
Vol 50
(4)
◽
pp. 721-738
◽
Keyword(s):
2007 ◽
pp. 15-15