241 search results - page 28 / 49 » Graphs, Hypergraphs and Hashing |
132
click to vote
ALENEX
2009
15 years 3 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
103
click to vote
JUCS
2007
15 years 1 months ago
2007
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
206
click to vote
ICDE
2007
IEEE
16 years 3 months ago
2007
IEEE
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...
132
click to vote
SYNASC
2008
IEEE
15 years 8 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
120
click to vote
COMBINATORICS
2006
15 years 1 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...