866 search results - page 56 / 174 » Bidirectionalizing graph transformations |
114
Voted
GD
2005
Springer
15 years 8 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...
120
click to vote
VL
1999
IEEE
15 years 7 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...
123
click to vote
ESCAPE
2007
Springer
15 years 6 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 ...
138
click to vote
WINET
2010
15 years 1 months ago
2010
We study routing algorithms for three-dimensional ad hoc networks that guarantee delivery and are k-local, i.e., each intermediate node v’s routing decision only depends on knowl...
135
click to vote
CORR
2010
Springer
15 years 10 days ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...