1002 search results - page 8 / 201 » Towards Graph Programs for Graph Algorithms |
123
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
117
Voted
ERLANG
2004
ACM
15 years 7 months ago
2004
ACM
Testing of software components during development is a heavily used approach to detect programming errors and to evaluate the quality of software. Systematic approaches to softwar...
141
click to vote
MP
2010
15 years 8 days ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
104
click to vote
FORTE
2004
15 years 3 months ago
2004
This paper proposes an algorithm for the construction of an MSC graph from a given set of actual behaviors of an existing concurrent system which has repetitive subfunctions. Such ...
111
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...