3105 search results - page 162 / 621 » The Path-Packing Structure of Graphs |
141
click to vote
BIRTHDAY
2008
Springer
15 years 5 months ago
2008
Springer
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
137
Voted
RSA
2008
15 years 3 months 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, ...
211
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...
121
click to vote
PR
2007
15 years 3 months ago
2007
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
124
click to vote
DAM
2011
14 years 10 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...