1736 search results - page 281 / 348 » On antimagic directed graphs |
129
click to vote
CGF
2008
15 years 1 months ago
2008
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
127
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take pa...
116
Voted
CONSTRAINTS
2008
15 years 1 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
108
Voted
CSDA
2010
15 years 1 months ago
2010
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
104
Voted
DISOPT
2008
15 years 1 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...