1550 search results - page 63 / 310 » Benchmarking for Graph Transformation |
127
click to vote
SETA
2004
Springer
15 years 6 months ago
2004
Springer
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
98
Voted
GD
2005
Springer
15 years 6 months ago
2005
Springer
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...
107
click to vote
VL
1999
IEEE
15 years 5 months ago
1999
IEEE
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host...
105
click to vote
ESCAPE
2007
Springer
15 years 4 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
102
click to vote
JBI
2004
15 years 2 months ago
2004
Metabolism can be regarded as a network of biochemical reactions, connected via their substrates and products. A metabolic pathway is thus a coordinated series of reactions, and i...