Sciweavers

2612 search results - page 110 / 523
» Assemblies as Graph Processes
Sort
View
IPL
2010
158views more  IPL 2010»
13 years 7 months ago
Finding bipartite subgraphs efficiently
Polynomial algorithms are given for the following two problems:
Dhruv Mubayi, György Turán
WWW
2007
ACM
14 years 10 months ago
Random web crawls
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
Toufik Bennouas, Fabien de Montgolfier
ECEASST
2006
305views more  ECEASST 2006»
13 years 10 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...
DM
2011
264views Education» more  DM 2011»
13 years 5 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
ASPDAC
2007
ACM
152views Hardware» more  ASPDAC 2007»
14 years 2 months ago
A Graph Reduction Approach to Symbolic Circuit Analysis
A new graph reduction approach to symbolic circuit analysis is developed in this paper. A Binary Decision Diagram (BDD) mechanism is formulated, together with a specially designed ...
Guoyong Shi, Weiwei Chen, C.-J. Richard Shi