9532 search results - page 70 / 1907 » Logic, Graphs, and Algorithms |
SODA
2008
ACM
15 years 17 days ago
2008
ACM
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
119
Voted
CONCUR
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
106
click to vote
JCT
2006
14 years 11 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
102
click to vote
WAW
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
DSD
2010
IEEE
14 years 11 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...