1542 search results - page 184 / 309 » The metamathematics of random graphs |
115
Voted
COMAD
2009
15 years 2 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
111
click to vote
SIGCOMM
2010
ACM
15 years 2 months ago
2010
ACM
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...
127
click to vote
CMOT
2004
15 years 1 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
118
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
106
click to vote
AINA
2010
IEEE
15 years 6 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...