z-logo
open-access-imgOpen Access
Mining Heavy Temporal Subgraphs: Fast Algorithms and Applications
Author(s) -
José Cadena,
Anil Vullikanti
Publication year - 2018
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v32i1.11807
Subject(s) - heuristics , scalability , computer science , heuristic , steiner tree problem , enhanced data rates for gsm evolution , algorithm , induced subgraph isomorphism problem , graph , subgraph isomorphism problem , set (abstract data type) , theoretical computer science , mathematical optimization , mathematics , artificial intelligence , line graph , voltage graph , database , programming language , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom