scientific article; zbMATH DE number 1339492

MaRDI QIDQ4264549zbMATH OpenFDO

Authors Claudio Arbib, Raffaele Mosca

Publication date 23 November 1999

zbMATH Keywords

balanced bipartite graphcharacterizationNP-completepolynomial algorithmsubgraph problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding bipartite subgraphs efficiently
• Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
• The complexity for the problems of covering of a graph with the minimum number of complete bipartite subgraphs
• scientific article; zbMATH DE number 4148138
• An attractive class of bipartite graphs

Cited in

(4)

• A polynomial algorithm for b-matchings: An alternative approach
• A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
• A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS
• Finding bipartite subgraphs efficiently

This page was built for publication:

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