Linear time recognition of weak bisplit graphs

MaRDI QIDQ2816090zbMATH OpenFDO

Authors Vassilis Giakoumakis, Jean-Marie Vanherpe

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305801465?np=y

zbMATH Keywords

decomposition scheme for bipartite graphsNP-complete optimization problems for general bipartite graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P₆-FREE GRAPHS
• On canonical decomposition of bipartite graphs
• Some optimization problems on weak-bisplit graphs
• A note on the recognition of bisplit graphs
• Bipartite graphs totally decomposable by canonical decomposition

Cited in

(4)

• A note on the recognition of bisplit graphs
• Bisplit graphs
• Bipartite graphs totally decomposable by canonical decomposition
• LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P₆-FREE GRAPHS

This page was built for publication: Linear time recognition of weak bisplit graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816090)