The following pages link to Database Theory - ICDT 2005 (Q5316621):
Displayed 4 items.
- An incremental algorithm for computing ranked full disjunctions (Q882441) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- Querying Regular Graph Patterns (Q3189642) (← links)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties (Q4631095) (← links)