760 search results - page 15 / 152 » Algorithms for finding clique-transversals of graphs |
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
CPC
2006
13 years 8 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
COLOGNETWENTE
2009
13 years 9 months ago
2009
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
ICDE
2000
IEEE
14 years 10 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
EDBT
2012
ACM
11 years 11 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...