In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
Dominic Lanphier, C. Miller, Jason Rosenhouse, A. ...
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
A method of drawing anchored maps for bipartite graphs is presented. Suppose that the node set of a bipartite graph is divided into set A and set B. On an anchored map of the bipa...
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
A method of drawing anchored maps for bipartite graphs is presented. Suppose that the node set of a bipartite graph is divided into set A and set B. On an anchored map of the bipar...
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
Christian Bessiere, George Katsirelos, Nina Narody...
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Query recommendation is considered an effective assistant in enhancing keyword based queries in search engines and Web search software. Conventional approach to query recommendati...
Lin Li, Zhenglu Yang, Ling Liu, Masaru Kitsuregawa