Efficient identifications of structural similarities for graphs (Q2444149): Difference between revisions
From MaRDI portal
Added link to MaRDI 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: SimRank / 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-012-9505-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2126997102 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Statistical mechanics of complex networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3286850 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Collective dynamics of ‘small-world’ networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph similarity scoring and matching / rank | |||
Normal rank |
Latest revision as of 14:51, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient identifications of structural similarities for graphs |
scientific article |
Statements
Efficient identifications of structural similarities for graphs (English)
0 references
8 April 2014
0 references
graph similarity
0 references
large-scale graphs
0 references
linear-time algorithm
0 references