Sciweavers

941 search results - page 1 / 189
» Efficient Testing of Large Graphs
Sort
View
FOCS
1999
IEEE
13 years 9 months ago
Efficient Testing of Large Graphs
Noga Alon, Eldar Fischer, Michael Krivelevich, Mar...
PVLDB
2008
108views more  PVLDB 2008»
13 years 4 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
DAC
1998
ACM
14 years 5 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak
EDBT
2009
ACM
132views Database» more  EDBT 2009»
13 years 11 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 6 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
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...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou