Recognition and combinatorial optimization algorithms for bipartite chain graphs

MaRDI QIDQ4610077zbMATH OpenFDO

Authors Mihai Talmaciu, Elena Nechita, Barna Laszlo Iantovics

Publication date 5 April 2018

zbMATH Keywords

bipartite chain graphscombinatorial optimization algorithmsrecognition algorithmsweakly decomposition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• Approximating the Minimum Chain Completion problem
• Bipartite permutation graphs
• Approximation algorithms for minimum chain vertex deletion
• scientific article; zbMATH DE number 1156661
• scientific article; zbMATH DE number 2086689

Cited in

(5)

• Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
• Approximation algorithms for minimum chain vertex deletion
• Bipartite graphs of small readability
• Bipartite graphs of small readability
• Approximating the Minimum Chain Completion problem

This page was built for publication: Recognition and combinatorial optimization algorithms for bipartite chain graphs

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