1002 search results - page 56 / 201 » Towards Graph Programs for Graph Algorithms |
123
click to vote
ICSE
1999
IEEE-ACM
15 years 6 months ago
1999
IEEE-ACM
In this paper we show how the FLAVERS data flow analysis technique, originally formulated for programs with the rendezvous model of concurrency, can be applied to concurrent Java...
106
Voted
DM
2008
15 years 2 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
126
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...
166
click to vote
COCOON
2010
Springer
15 years 1 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
124
Voted
COCOA
2007
Springer
15 years 8 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...