779 search results - page 61 / 156 » A graph polynomial for independent sets of bipartite graphs |
ARSCOM
2007
14 years 10 months ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
114
click to vote
PROPERTYTESTING
2010
14 years 7 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
SRDS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...