1736 search results - page 103 / 348 » On antimagic directed graphs |
107
click to vote
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, ...
167
click to vote
SIGMOD
2009
ACM
16 years 4 days ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
CAV
2010
Springer
15 years 3 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...
107
click to vote
JALC
2002
14 years 11 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
100
click to vote
ALT
2010
Springer
14 years 7 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