803 search results - page 22 / 161 » Independence in Direct-Product Graphs |
92
Voted
IJAC
2007
15 years 18 days ago
2007
In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions C (1/6) and C (1/4) − T (4) has the property that...
169
click to vote
PODC
2011
ACM
14 years 3 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
132
Voted
GC
2002
Springer
15 years 13 days ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
108
click to vote
COCO
2007
Springer
15 years 6 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
286
Voted
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from ...