Sciweavers

2612 search results - page 121 / 523
» Assemblies as Graph Processes
Sort
View
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
15 years 12 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
15 years 7 months ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
16 years 1 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
AGTIVE
2003
Springer
15 years 11 months ago
Integrating Graph Rewriting and Standard Software Tools
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
Uwe Aßmann, Johan Lövdahl
PVLDB
2010
122views more  PVLDB 2010»
15 years 4 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han