A Representation of bipartite graphs by digraphs and its programming application

DOI10.1080/00207168108803262MaRDI QIDQ3926601zbMATH OpenOpenAlexWikidataFDO

Authors Kabekode V. S. Bhat

Publication date 1981

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168108803262

zbMATH Keywords

bipartite graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites work

• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Two Algorithms for Bipartite Graphs
• Two-Commodity Flow

This page was built for publication: A Representation of bipartite graphs by digraphs and its programming application

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