5473 search results - page 727 / 1095 » On the graph isomorphism problem |
197
click to vote
IJCM
2002
15 years 6 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
165
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
155
click to vote
TC
1998
15 years 6 months ago
1998
—Many built-in self-testing (BIST) schemes compress the test responses from a k-output circuit to q signature streams, where q << k, a process termed space compaction. The ...
202
click to vote
TOG
2002
15 years 6 months ago
2002
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
157
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...