492 search results - page 22 / 99 » Perfect Matching Preservers |
128
click to vote
CIARP
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. In this paper, we address the problem of opinion analysis using a probabilistic approach to the underlying structure of different types of opinions or sentiments around ...
TAMC
2009
Springer
15 years 6 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
ORL
2008
14 years 11 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
117
click to vote
JCT
2010
14 years 10 months ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
AICCSA
2007
IEEE
15 years 6 months ago
2007
IEEE
Several matching algorithms were recently developed in order to automate or semi-automate the process of correspondences discovery between XML schemas. These algorithms use a wide...