231 search results - page 13 / 47 » The Number of Independent Sets in a Regular Graph |
AINA
2010
IEEE
15 years 4 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...
108
click to vote
COMBINATORICS
2006
14 years 11 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
100
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
A heterogeneous information network is a network composed of multiple types of objects and links. Recently, it has been recognized that strongly-typed heterogeneous information net...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
118
click to vote
COMGEO
2006
ACM
14 years 11 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...