1736 search results - page 276 / 348 » On antimagic directed graphs |
126
click to vote
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
Protecting sensitive information while preserving the shareability and usability of data is becoming increasingly important. In call-centers a lot of customer related sensitive in...
CEC
2005
IEEE
15 years 1 months ago
2005
IEEE
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
CSCWD
2005
Springer
15 years 1 months ago
2005
Springer
This paper presents a simple and novel structure representation supporting the assembly and disassembly planning of electromechanical products. The proposed Relationship Matrix de...
102
click to vote
COCOON
2008
Springer
15 years 1 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
DIALM
2008
ACM
15 years 1 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...