Sciweavers

Share
COMBINATORICA
2006
70views more  COMBINATORICA 2006»
9 years 4 months ago
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements
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...
Michele Conforti, Gérard Cornuéjols,...
ARSCOM
2006
140views more  ARSCOM 2006»
9 years 4 months ago
Expansion Properties Of Levi Graphs
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. ...
ARSCOM
2007
77views more  ARSCOM 2007»
9 years 4 months ago
Extremal bipartite graphs with high girth
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...
Camino Balbuena, Pedro García-Vázque...
ALGORITHMICA
2010
108views more  ALGORITHMICA 2010»
9 years 4 months ago
An Efficient Algorithm for Batch Stability Testing
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...
John Dabney, Brian C. Dean
APVIS
2006
9 years 5 months ago
Drawing bipartite graphs as anchored maps
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...
Kazuo Misue
IPCO
2007
77views Optimization» more  IPCO 2007»
9 years 5 months ago
Mixed-Integer Vertex Covers on Bipartite Graphs
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...
Michele Conforti, Bert Gerards, Giacomo Zambelli
HCI
2007
9 years 5 months ago
Anchored Maps: Visualization Techniques for Drawing Bipartite Graphs
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...
Kazuo Misue
AAAI
2010
9 years 5 months ago
Propagating Conjunctions of AllDifferent Constraints
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...
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
9 years 5 months ago
Edge Coloring and Decompositions of Weighted Graphs
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...
Uriel Feige, Mohit Singh
AAAI
2008
9 years 6 months ago
Query-URL Bipartite Based Approach to Personalized Query Recommendation
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
books