5608 search results - page 354 / 1122 » On the Theory of Matchgate Computations |
146
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
142
click to vote
WG
2000
Springer
15 years 10 months ago
2000
Springer
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
229
click to vote
WMP
2000
15 years 10 months ago
2000
This paper is an attempt to summarize the basic elements of the multiset theory. We begin by describing multisets and the operations between them, then we present hybrid sets and t...
192
click to vote
FCT
1995
Springer
15 years 10 months ago
1995
Springer
The concatenable processes of a Petri net N can be characterized ly as the arrows of a symmetric monoidal category P[N]. Yet, this is only a partial axiomatization, since P[N] is b...
181
click to vote
GD
2009
Springer
15 years 10 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...