Querying Relational Event Graphs Using Colored Range Searching Data Structures (Q2971637): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Counting Subgraphs in Relational Event Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4931752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Influence diffusion in social networks under time window constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4643897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERALIZED INTERSECTION SEARCHING PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Search Trees / rank
 
Normal rank

Latest revision as of 15:22, 13 July 2024

scientific article
Language Label Description Also known as
English
Querying Relational Event Graphs Using Colored Range Searching Data Structures
scientific article

    Statements

    Querying Relational Event Graphs Using Colored Range Searching Data Structures (English)
    0 references
    0 references
    0 references
    0 references
    7 April 2017
    0 references
    colored range searching
    0 references
    relational event graph
    0 references
    social network analysis
    0 references
    timestamp
    0 references

    Identifiers