Efficient algorithms for supergraph query processing on graph databases (Q630186): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: CloseGraph / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-009-9221-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2126194878 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A minimal line property preserving representation of line images / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Subgraph Isomorphism / rank | |||
Normal rank | |||
Latest revision as of 20:54, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for supergraph query processing on graph databases |
scientific article |
Statements
Efficient algorithms for supergraph query processing on graph databases (English)
0 references
17 March 2011
0 references
query processing
0 references
graph indexing
0 references
