1736 search results - page 115 / 348 » On antimagic directed graphs |
166
click to vote
SIGSOFT
1994
ACM
15 years 10 months ago
1994
ACM
A dependence model for reverse engineering should treat procedures in a modular fashion and should be fine-grained, distinguishing dependences that are due to different variables....
164
click to vote
ASWEC
2004
IEEE
15 years 10 months ago
2004
IEEE
Object-oriented programs, when executed, produce a complex webs of objects and references between them, generally referred to as object graphs. These object graphs are difficult t...
165
click to vote
FCS
2006
15 years 7 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...
157
Voted
CIIA
2009
15 years 7 months ago
2009
Several rule discovery algorithms have the disadvantage to discover too much patterns sometimes obvious, useless or not very interesting to the user. In this paper we propose a new...
136
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...