Pages that link to "Item:Q2842169"
From MaRDI portal
The following pages link to A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs (Q2842169):
Displaying 8 items.
- Efficient algorithms for subgraph listing (Q1736617) (← links)
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (Q2941505) (← links)
- The h-Index of a Graph and its Application to Dynamic Subgraph Statistics (Q3143753) (← links)
- Simultaneously load balancing for every p-norm, with reassignments (Q4638106) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- Rare siblings speed-up deterministic detection and counting of small pattern graphs (Q5925690) (← links)
- On linear algebraic algorithms for the subgraph matching problem and its variants (Q6164954) (← links)
- A color-avoiding approach to subgraph counting in bounded expansion classes (Q6174815) (← links)