<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Discrete mathematics / Directed graph / Graph / Centrality / Topological graph theory / Degree / Sequence / Sequential pattern mining / Directed acyclic graph / Pathwidth
Date: 2017-10-04 00:22:43
Graph theory
Mathematics
Discrete mathematics
Directed graph
Graph
Centrality
Topological graph theory
Degree
Sequence
Sequential pattern mining
Directed acyclic graph
Pathwidth

Complex Patterns in Dynamic Attributed Graphs Rina Singh, Jeffrey A. Graves, Douglas A. Talbert Department of Computer Science Tennessee Technological University Cookeville, TN USA

Add to Reading List

Source URL: gdac.uqam.ca

Download Document from Source Website

File Size: 676,60 KB

Share Document on Facebook

Similar Documents

Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1

Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1

DocID: 1rmNc - View Document

Kronos: The Design and Implementation of an Event Ordering Service Robert Escriva Ayush Dubey

Kronos: The Design and Implementation of an Event Ordering Service Robert Escriva Ayush Dubey

DocID: 1qU2V - View Document

Querying DAG-shaped Execution Traces Through Views Maya Ben-Ari Tova Milo  Elad Verbin

Querying DAG-shaped Execution Traces Through Views Maya Ben-Ari Tova Milo Elad Verbin

DocID: 1qJ8t - View Document

Evaluating TOP-K Queries Over Business Processes Daniel Deutch, Tova Milo Tel Aviv University {danielde,milo}@post.tau.ac.il  Abstract— A Business Process (BP) consists of some business

Evaluating TOP-K Queries Over Business Processes Daniel Deutch, Tova Milo Tel Aviv University {danielde,milo}@post.tau.ac.il Abstract— A Business Process (BP) consists of some business

DocID: 1qIGc - View Document

Algorithms and Data Structures Winter TermExercises for UnitProve that the implementation for the DFS-framework presented in the lecture correctly identifies the strongly connected components in a directe

Algorithms and Data Structures Winter TermExercises for UnitProve that the implementation for the DFS-framework presented in the lecture correctly identifies the strongly connected components in a directe

DocID: 1qy6z - View Document