You’ve probably seen some polynomial-time algorithms for the problem of computing a maximum-weight matching of a bipartite graph. Many of these, like the Kuhn-Tucker algorithm [?] are “combinatorial algorithms,” meaning that all of its steps work directly with the graph. Linear programming is also an effective tool for solving many discrete optimization problems. For example, consider the follo...

You’ve probably seen some polynomial-time algorithms for the problem of computing a maximum-weight matching of a bipartite graph. Many of these, like the Kuhn-Tucker algorithm [9], are “combinatorial algorithms” that operate directly on the graph. Linear programming is also an effective tool for solving many discrete optimization problems. For example, consider the following linear programming ...

It is well-known that any graph has all real eigenvalues and a graph is bipartite if and only if its spectrum is symmetric with respect to the origin. We are interested in finding whether the permanental roots of a bipartite graph G have symmetric property as the spectrum of G. In this note, we show that the permanental roots of bipartite graphs are symmetric with respect to the real and imagin...

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

Subgraph enumeration problems ask to output all subgraphs of an input graph that belongs to the specified graph class or satisfy the given constraint. These problems have been widely studied in theoretical computer science. As far, many efficient enumeration algorithms for the fundamental substructures such as spanning trees, cycles, and paths, have been developed. This paper addresses the enum...

We propose geometrical methods for constructing square 01-matrices with the same number n of units in every row and column, and such that any two rows of the matrix contain at most one unit in common. These matrices are equivalent to n-regular bipartite graphs without 4-cycles, and therefore can be used for the construction of efficient bipartite-graph codes such that both the classes of its ve...

A bipartite graph G = (U, V, E) is a chain graph [9] if there is a bijection π : {1, . . . , |U |} → U such that Γ (π (1)) ⊇ Γ (π (2)) ⊇ . . . ⊇ Γ (π (|U |)), where Γ is a function that maps a node to its neighbors. We give approximation algorithms for two variants of the Minimum Chain Completion problem, where we are given a bipartite graph G(U, V, E), and the goal is find the minimum set of e...

Pk -factorization of a complete bipartite graph for k, an even integer was studied by H. Wang [1]. Further, Beiling Du [2] extended the work of H.Wang, and studied the P2k-factorization of complete bipartite multigraph. For odd value of k the work on factorization was done by a number of researchers[3,4,5]. P3-factorization of complete bipartite graph was studied by K.Ushio [3]. P5-factorizatio...

|This paper describes an algorithm for nding all the perfect matchings in a bipartite graph. By using the binary partitioning method, our algorithm requires O(c(n+m) + n 2:5 ) computational e ort and O(nm) memory storage, (where n denotes the number of vertices, m denotes the number of edges, and c denotes the number of perfect matchings in the given bipartite graph). Keywords|bipartite graph, ...