Subgraph nomination: query by example subgraph retrieval in networks (Q6171795): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Vertex nomination, consistent estimation, and adversarial modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast unfolding of communities in large networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex nomination schemes for membership prediction / rank
 
Normal rank
Property / cites work
 
Property / cites work: MCLUST: Software for model-based cluster analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Community Detection by Recursive Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning to Rank for Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2834517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5381123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex nomination via seeded graph matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonparametric two-sample hypothesis testing problem for random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex nomination: the canonical sampling and the extended spectral nomination schemes / rank
 
Normal rank

Revision as of 18:12, 1 August 2024

scientific article; zbMATH DE number 7713796
Language Label Description Also known as
English
Subgraph nomination: query by example subgraph retrieval in networks
scientific article; zbMATH DE number 7713796

    Statements

    Identifiers