1736 search results - page 71 / 348 » The rank-width of Directed Graphs |
227
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...
120
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
We present the algorithms used in MCVETO (Machine-Code VErification TOol), a tool to check whether a stripped machinecode program satisfies a safety property. The verification p...
136
click to vote
ALT
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
163
click to vote
MOBIHOC
2012
ACM
13 years 6 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
140
click to vote
DCC
2001
IEEE
16 years 3 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...