Counting subgraphs in relational event graphs
DOI10.1007/978-3-319-30139-6_16zbMATH Open1475.68234OpenAlexW2494842936MaRDI QIDQ2803823FDOQ2803823
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
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
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)
Cites Work
- An Algorithm for Subgraph Isomorphism
- Collective dynamics of `small-world' networks
- The Complexity of Enumeration and Reliability Problems
- Title not available (Why is that?)
- Finding and counting given length cycles
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Finding and counting small induced subgraphs efficiently
- Title not available (Why is that?)
- Arboricity and Subgraph Listing Algorithms
- Finding a Minimum Circuit in a Graph
- Title not available (Why is that?)
- Diameter and treewidth in minor-closed graph families
- Subgraph Isomorphism in Planar Graphs and Related Problems
- On the complexity of fixed parameter clique and dominating set
- Arboricity and bipartite subgraph listing algorithms
- Matrix measures for transitivity and balance*
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)
