3204 search results - page 577 / 641 » The Alcuin Number of a Graph |
146
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
169
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
186
click to vote
IJAHUC
2008
15 years 6 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
151
click to vote
IJMC
2006
15 years 6 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
145
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
Part I of this paper showed that the hidden subgroup problem over the symmetric group--including the special case relevant to Graph Isomorphism--cannot be efficiently solved by st...