1162 search results - page 67 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
133
click to vote
GC
2002
Springer
15 years 6 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
183
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
251
click to vote
VLDB
2001
ACM
16 years 6 months ago
2001
ACM
In this paper, we present an approach to global transactionmanagementinworkflowenvironments.Thetransaction mechanism is based on the well-known notion of compensation, but extended...
172
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
173
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
For many tracking and surveillance applications, background subtraction provides an effective means of segmenting objects moving in front of a static background. Researchers have ...