361 search results - page 23 / 73 » Relaxed Gabriel Graphs |
144
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
156
click to vote
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this short paper we describe the setup and results of a new initiative to compare graph transformation tools, carried out as part of the AGTIVE 2007 symposium on “Ap...
126
click to vote
IJCNN
2006
IEEE
15 years 10 months ago
2006
IEEE
— Recursive Neural Networks (RNNs) and Graph Neural Networks (GNNs) are two connectionist models that can directly process graphs. RNNs and GNNs exploit a similar processing fram...
119
click to vote
ECEASST
2008
15 years 4 months ago
2008
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
123
click to vote
STOC
1999
ACM
15 years 8 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...