1736 search results - page 125 / 348 » On antimagic directed graphs |
176
click to vote
DAM
2010
15 years 4 months ago
2010
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
140
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
166
click to vote
IMECS
2007
15 years 7 months ago
2007
The benefit of incorporating background knowledge in the learning process has been successfully demonstrated in numerous applications of ILP methods. Nevertheless the effect of inc...
163
click to vote
SDM
2004
SIAM
15 years 7 months ago
2004
SIAM
How does a `normal' computer (or social) network look like? How can we spot `abnormal' sub-networks in the Internet, or web graph? The answer to such questions is vital ...
162
click to vote
EACL
1989
ACL Anthology
15 years 7 months ago
1989
ACL Anthology
We propose an apparently minor extension to Kay's (1985} notation for describing directed acyclic graphs (DAGs}. The proposed notation permits concise descriptions of phenome...