Edge cover by connected bipartite subgraphs

DOI10.1007/s10479-009-0533-4zbMath1225.90146OpenAlexW1997237728MaRDI QIDQ646717

Leo Liberti, Laurent Alfandari, Marie-Christine Plateau

Publication date: 17 November 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-009-0533-4

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (2)

Edge covering problem under hybrid uncertain environments ⋮ Edge cover by connected bipartite subgraphs

Uses Software

• AMPL
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge cover by connected bipartite subgraphs
• Consensus algorithms for the generation of all maximal bicliques
• Confluent layered drawings
• Minimal cut cover of a graph with an application to the testing of electronic boards
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• Laplacian eigenvalues and the maximum cut problem
• Laplacian matrices of graphs: A survey
• Struction revisited
• Computational aspects of the 2-dimension of partially ordered sets
• On edge perfectness and classes of bipartite graphs
• HAMILTONian circuits in chordal bipartite graphs
• Chromatic characterization of biclique covers

This page was built for publication: Edge cover by connected bipartite subgraphs