Sciweavers

1736 search results - page 64 / 348
» On antimagic directed graphs
Sort
View
EDBTW
2010
Springer
14 years 5 months ago
Biochemical network matching and composition
Graph composition has applications in a variety of practical applications. In drug development, for instance, in order to understand possible drug interactions, one has to merge k...
Martin Hugh Goodfellow, John Wilson, Ela Hunt
CSE
2009
IEEE
14 years 5 months ago
Structure of Neighborhoods in a Large Social Network
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
Alina Stoica, Christophe Prieur
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
14 years 2 months ago
Improving coverage analysis and test generation for large designs
State space techniques have proven to be useful for measuring and improving the coverage of test vectors that are used during functional validation via simulation. By comparing th...
Jules P. Bergmann, Mark Horowitz
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 2 months ago
Percolation in the Secrecy Graph
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
Amites Sarkar, Martin Haenggi
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
13 years 11 months ago
Testing Euclidean Spanners
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
Frank Hellweg, Melanie Schmidt, Christian Sohler