165 search results - page 6 / 33 » A New Algorithm for On-line Coloring Bipartite Graphs |
135
click to vote
IPMU
2010
Springer
15 years 6 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
119
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
135
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
130
click to vote
DAM
2006
15 years 4 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
181
click to vote
ISAAC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...