A Representation of bipartite graphs by digraphs and its programming application

DOI10.1080/00207168108803262zbMath0472.05025OpenAlexW1966628041WikidataQ126256752 ScholiaQ126256752MaRDI QIDQ3926601

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

• Unnamed Item
• Two-Commodity Flow
• Perfect Elimination and Chordal Bipartite Graphs
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Two Algorithms for Bipartite Graphs

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