Counting subgraphs in relational event graphs

DOI10.1007/978-3-319-30139-6_16MaRDI QIDQ2803823zbMATH OpenOpenAlexFDO

Authors Farah Chanchary, Anil Maheshwari

Publication date 3 May 2016

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-30139-6_16

zbMATH Keywords

subgraph countingtimestamprelational event graphdominance counting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Data structures (68P05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Enumeration in graph theory (05C30)

Recommendations

• Windows into relational events: data structures for contiguous subsequences of edges
• Querying Relational Event Graphs Using Colored Range Searching Data Structures
• Querying relational event graphs using colored range searching data structures
• Time windowed data structures for graphs
• Extended dynamic subgraph statistics using \(h\)-index parameterized data structures

Cites work

• scientific article; zbMATH DE number 3910446 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• An Algorithm for Subgraph Isomorphism
• Arboricity and Subgraph Listing Algorithms
• Arboricity and bipartite subgraph listing algorithms
• Collective dynamics of `small-world' networks
• Diameter and treewidth in minor-closed graph families
• Finding a Minimum Circuit in a Graph
• Finding and counting given length cycles
• Finding and counting small induced subgraphs efficiently
• Matrix measures for transitivity and balance*
• On the complexity of fixed parameter clique and dominating set
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
• Subgraph Isomorphism in Planar Graphs and Related Problems
• The Complexity of Enumeration and Reliability Problems

Cited in

(5)

• Querying Relational Event Graphs Using Colored Range Searching Data Structures
• Time windowed data structures for graphs
• The Most Likely Object to be Seen Through a Window
• Windows into relational events: data structures for contiguous subsequences of edges
• Querying relational event graphs using colored range searching data structures

This page was built for publication: Counting subgraphs in relational event graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803823)