1550 search results - page 98 / 310 » Benchmarking for Graph Transformation |
137
Voted
UAI
2004
15 years 4 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
306
Voted
PAMI
2010
15 years 1 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
130
click to vote
RV
2010
Springer
15 years 1 months ago
2010
Springer
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
154
Voted
DAGSTUHL
2001
15 years 4 months ago
2001
GXL (Graph eXchange Language) is designed to be a standard exchange format for graph-based tools. GXL is defined as an XML sublanguage, which offers support for exchanging instanc...
155
click to vote
VL
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper outlines DIAPLAN, a visual rule-based programming language and environment that is based on the computational model of graph transformation. Thanks to its genericity, D...