401 search results - page 54 / 81 » Sparse Quasi-Random Graphs |
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
The study of information flow analyzes the principles and mechanisms of social information distribution. It is becoming an extremely important research topic in social network re...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
CP
2009
Springer
14 years 8 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
SIAMDM
2008
13 years 6 months ago
2008
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for v...