Sciweavers

Share
PVLDB
2008
116views more  PVLDB 2008»
9 years 3 months ago
Anonymizing bipartite graph data using safe groupings
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
Graham Cormode, Divesh Srivastava, Ting Yu, Qing Z...
ORL
2007
82views more  ORL 2007»
9 years 3 months ago
The path partition problem and related problems in bipartite graphs
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
Jérôme Monnot, Sophie Toulouse
CORR
2010
Springer
136views Education» more  CORR 2010»
9 years 3 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
JCO
2000
59views more  JCO 2000»
9 years 3 months ago
Facets of an Assignment Problem with 0-1 Side Constraint
We show that the problem of finding a perfect matching satisfying a single equality constraint with a 0
Abdo Y. Alfakih, Tongnyoul Yi, Katta G. Murty
APPML
2005
80views more  APPML 2005»
9 years 3 months ago
On the pseudo-inverse of the Laplacian of a bipartite graph
1 We provide an efficient method to calculate the pseudo-inverse of the Laplacian of a bipartite graph, which is2 based on the pseudo-inverse of the normalized Laplacian.3
Ngoc-Diep Ho, Paul Van Dooren
SIAMDM
2008
148views more  SIAMDM 2008»
9 years 3 months ago
A New Algorithm for On-line Coloring Bipartite Graphs
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
Hajo Broersma, Agostino Capponi, Daniël Paulu...
JGT
2006
97views more  JGT 2006»
9 years 3 months ago
Matchings in hypergraphs of large minimum degree
It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains a perfect matching. We prove an analogue of this result for...
Daniela Kühn, Deryk Osthus
DM
2007
125views more  DM 2007»
9 years 3 months ago
Generalized switch-setting problems
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
Torsten Muetze
JGAA
2008
97views more  JGAA 2008»
9 years 3 months ago
Drawing Bipartite Graphs on Two Parallel Convex Curves
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta
DAM
2006
100views more  DAM 2006»
9 years 3 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling
books