22 search results - page 1 / 5 » Independent sets in tensor graph powers |
JGT
2007
13 years 4 months ago
2007
CVPR
2009
IEEE
15 years 2 days ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...
AINA
2010
IEEE
13 years 9 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
COMBINATORICS
2004
13 years 4 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...
ASUNAM
2011
IEEE
12 years 4 months ago
2011
IEEE
—Modern applications such as web knowledge base, network traffic monitoring and online social networks have made available an unprecedented amount of network data with rich type...