5606 search results - page 578 / 1122 » Randomization Techniques for Graphs. |
194
click to vote
KBSE
2005
IEEE
16 years 22 days ago
2005
IEEE
Software verification using model checking often translates programs into corresponding transition systems that model the program behavior. As software systems continue to grow i...
175
click to vote
SWAT
2004
Springer
16 years 15 days ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
180
click to vote
WSDM
2010
ACM
16 years 4 months ago
2010
ACM
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a ...
219
click to vote
SP
2008
IEEE
16 years 1 months ago
2008
IEEE
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
203
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...