779 search results - page 8 / 156 » A graph polynomial for independent sets of bipartite graphs |
ALGORITHMICA
2004
13 years 8 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
MM
2010
ACM
13 years 8 months ago
2010
ACM
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...
APVIS
2006
13 years 9 months ago
2006
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...
DM
2000
13 years 8 months ago
2000
For integers p; q; s with p
STOC
2005
ACM
14 years 8 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...