Sciweavers

1648 search results - page 59 / 330
» On the generation of bicliques of a graph
Sort
View
ICDM
2006
IEEE
81views Data Mining» more  ICDM 2006»
15 years 5 months ago
Full Perfect Extension Pruning for Frequent Graph Mining
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
Christian Borgelt, Thorsten Meinl
BIRTHDAY
2004
Springer
15 years 4 months ago
Formal Properties of Gene Assembly: Equivalence Problem for Overlap Graphs
del based on (overlap) graphs. The latter is more abstract because the translation of legal strings into overlap graphs is not injective. In this paper we consider and solve the ov...
Tero Harju, Ion Petre, Grzegorz Rozenberg
WAW
2004
Springer
80views Algorithms» more  WAW 2004»
15 years 4 months ago
Dominating Sets in Web Graphs
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
Colin Cooper, Ralf Klasing, Michele Zito
IJCAI
2001
15 years 24 days ago
Search on High Degree Graphs
We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study ...
Toby Walsh
PUK
2000
15 years 23 days ago
OCL-Graph: Exploiting Object Structure in a Plan Graph Algorithm
In this paper we discuss and describe preliminary results of integrating two strands of planning research - that of using plan graphs to speed up planning, and that of using object...
Ron M. Simpson, T. L. McCluskey, Donghong Liu