Sciweavers

1153 search results - page 82 / 231
» Reversing graph transformations
Sort
View
VL
1999
IEEE
104views Visual Languages» more  VL 1999»
14 years 3 months ago
Pragmatic Graph Rewriting Modifications
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...
Peter J. Rodgers, Natalia Vidal
ESCAPE
2007
Springer
256views Algorithms» more  ESCAPE 2007»
14 years 3 months ago
A More Effective Linear Kernelization for Cluster Editing
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 ...
Jiong Guo
SPIRE
2009
Springer
14 years 5 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
JBI
2004
163views Bioinformatics» more  JBI 2004»
14 years 17 days ago
Artificial Chemistries and Metabolic Pathways
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...
Liliana Félix, Francesc Rosselló, Ga...
CHI
1996
ACM
14 years 3 months ago
Gratuitous Graphics? Putting Preferences in Perspective
Rapid growth in 3-D rendering technologies has deluged us with glitzy graphical representations. In what contexts do people find 3-D graphs of 2-D data both attractive and useful?...
Ellen Levy, Jeff Zacks, Barbara Tversky, Diane J. ...