Counting Subgraphs in Relational Event Graphs

DOI10.1007/978-3-319-30139-6_16zbMath1475.68234OpenAlexW2494842936MaRDI QIDQ2803823

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

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

Related Items (3)

Querying relational event graphs using colored range searching data structures ⋮ Querying Relational Event Graphs Using Colored Range Searching Data Structures ⋮ The Most Likely Object to be Seen Through a Window

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding and counting small induced subgraphs efficiently
• Finding and counting given length cycles
• On the complexity of fixed parameter clique and dominating set
• Arboricity and bipartite subgraph listing algorithms
• Diameter and treewidth in minor-closed graph families
• Arboricity and Subgraph Listing Algorithms
• The Complexity of Enumeration and Reliability Problems
• An Algorithm for Subgraph Isomorphism
• Finding a Minimum Circuit in a Graph
• Matrix measures for transitivity and balance*
• Subgraph Isomorphism in Planar Graphs and Related Problems
• Collective dynamics of ‘small-world’ networks
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting

This page was built for publication: Counting Subgraphs in Relational Event Graphs