1736 search results - page 188 / 348 » On antimagic directed graphs |
197
click to vote
PVLDB
2010
15 years 4 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
192
click to vote
WICON
2008
15 years 8 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
169
click to vote
GPEM
2006
15 years 6 months ago
2006
There are various representations for encoding graph structures, such as artificial neural networks (ANNs) and circuits, each with its own strengths and weaknesses. Here we analyz...
168
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
172
click to vote
VIP
2003
15 years 7 months ago
2003
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...