147 search results - page 25 / 30 » The Number of Independent Sets in a Graph with Small Maximum... |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
GD
2005
Springer
14 years 28 days ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
RSA
2008
13 years 6 months ago
2008
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
In this paper, we present a comprehensive theoretical analysis of the sampling technique for the association rule mining problem. Most of the previous works have concentrated only...
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...