An extremal bandwidth problem for bipartite graphs
Journal of International Crisis and Risk Communication Research · 2000
This paper discusses the problem of finding the maximum number of edges E(m,n,B) in a bipartite graph having partite set sizes m and n and bandwidth B. Exact values for E(m,n,B) are found for many cases. (C) 2000 John Wiley & Sons, Inc.