Polynomial delay

In the analysis of algorithms, an algorithm for listing a large or infinite collection of structures is said to have polynomial delay if the time… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A system for efficient keyword search in graphs is demonstrated. The system has two components, a search through only the nodes… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Algorithms that list graphs such that no two listed graphs are isomorphic, are important building blocks of systems for mining… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2009
2009
In this paper, we study the problem of mining frequent diamond episodes efficiently from an input event sequence with sliding a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Mining frequently appearing patterns in a database is a basic problem in recent informatics, especially in data mining… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Of many graph mining algorithms an essential component is its procedure for enumerating graphs such that no two enumerated graphs… (More)
  • figure 1
Is this relevant?
2007
2007
In this paper, we consider the problem of enumerating all maximal motifs in an input string for the class of repeated motifs with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Mining frequently appearing patterns in a database is a basic problem in informatics, especially in data mining. Particularly… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
Full disjunctions are an associative extension of the outer-join operator to an arbitrary number of relations. Their main… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Description Logics (DLs) are suitable, well-known, logics for managing structured knowledge. They allow reasoning about… (More)
  • table 2
  • table 3
Is this relevant?
1993
1993
The main result of this paper is a method that turns any almost sure sentence in the first order language of graphs into a… (More)
Is this relevant?