Algorithms for finding biclique covers of graphs with bounded pathwidth

zbMATH Open1255.68103MaRDI QIDQ2906901FDOQ2906901

Authors: V. V. Lepin, Oleg Duginov 

Publication date: 5 September 2012

Published in: Trudy Instituta Matematiki (Search for Journal in Brave)

Recommendations

• On cycle covers of graphs with bounded pathwidth
• Algorithms for solving problems on graphs of bounded pathwidth
• scientific article; zbMATH DE number 5543290
• Exact exponential-time algorithms for finding bicliques
• Covering graphs with few complete bipartite subgraphs

zbMATH Keywords

space-efficient algorithmsbiclique cover problems on graphs with bounded pathwidth

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Cited In (8)

• On biclique covering number of the Cartesian product of graphs
• On cycle covers of graphs with bounded pathwidth
• Algorithms for finding disjoint path covers in unit interval graphs
• The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
• Title not available (Why is that?)
• Exact exponential-time algorithms for finding bicliques
• Problems and invariants connected with bicliques and multicliques of graphs
• Algorithms for solving problems on graphs of bounded pathwidth

This page was built for publication: Algorithms for finding biclique covers of graphs with bounded pathwidth

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