1805 search results - page 107 / 361 » Functional programming with structured graphs |
DAGSTUHL
1993
15 years 2 months ago
1993
In this paper we present a type system for graph rewrite systems: uniqueness typing. It employs usage information to deduce whether an object is `unique' at a certain moment,...
109
click to vote
WWW
2008
ACM
16 years 1 months ago
2008
ACM
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
104
click to vote
CPAIOR
2007
Springer
15 years 7 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
109
click to vote
CCGRID
2006
IEEE
15 years 5 months ago
2006
IEEE
Our current research into programming models for parallel web services composition is targeted at providing mechanisms for obtaining higher throughput for large scale compute and ...
119
click to vote
RSA
2008
15 years 21 days ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...