Sciweavers

1199 search results - page 32 / 240
» Graph Theory
Sort
View
111
Voted
COMBINATORICS
1999
80views more  COMBINATORICS 1999»
15 years 2 months ago
On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
Anna Galluccio, Martin Loebl
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 6 months ago
Data Base Mappings and Theory of Sketches
In this paper we will present the two basic operations for database schemas used in database mapping systems (separation and Data Federation), and we will explain why the functoria...
Zoran Majkic
126
Voted
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
16 years 2 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
CORR
2008
Springer
136views Education» more  CORR 2008»
15 years 2 months ago
Matrix Graph Grammars
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previ...
Pedro Pablo Pérez Velasco
128
Voted
RTA
2009
Springer
15 years 9 months ago
An Explicit Framework for Interaction Nets
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
Marc de Falco