1736 search results - page 114 / 348 » On antimagic directed graphs |
175
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
170
click to vote
TIP
2008
15 years 6 months ago
2008
We introduce a graph Laplacian based algorithm for the tomography reconstruction of a planar object from its projections taken at random unknown directions. The algorithm is shown ...
136
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with, respectively, nA and nB vertices. We define an nB
179
click to vote
VIP
2000
15 years 7 months ago
2000
This paper presents a system for graph clustering where users can visualize the clustering and give "hints" that help a computing method to find better solutions. Hints ...
169
click to vote
SIGECOM
2009
ACM
16 years 22 days ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...