1756 search results - page 179 / 352 » Directed scale-free graphs |
SAC
2009
ACM
14 years 3 months ago
2009
ACM
In this paper, we present our research result that enables users to navigate a very large social network and to take a look at information flows on the network. To this end, we d...
WEA
2009
Springer
14 years 3 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
ICHIT
2009
Springer
14 years 2 months ago
2009
Springer
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
SEFM
2008
IEEE
14 years 2 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...