493 search results - page 30 / 99 » Graph Database Indexing Using Structured Graph Decomposition |
RSA
2008
13 years 7 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, ...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
EMMCVPR
2005
Springer
14 years 1 months ago
2005
Springer
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
IV
2003
IEEE
14 years 28 days ago
2003
IEEE
It is often useful to get high-level views of datasets in order to identify areas of interest worthy of further exploration. In relational databases, the high-level view can be de...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...