Cover Image

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cai, Xinwei, Ke, Xiangyu, Wang, Kai, Chen, Lu, Zhang, Tianming, Liu, Qing, Gao, Yunjun
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
by: Meng, Lingkai, et al.
Published: (2024)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
by: Adamson, Duncan, et al.
Published: (2025)

Approximate Butterfly Counting in Sublinear Time
by: Luo, Chi, et al.
Published: (2026)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
by: Ye, Xiaowei, et al.
Published: (2024)

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
by: Kiran, Mekala, et al.
Published: (2026)

Efficient Kernelization Algorithm for Bipartite Graph Matching
by: Wu, Guang, et al.
Published: (2024)

Biclique Reconfiguration in Bipartite Graphs
by: Otachi, Yota, et al.
Published: (2026)

New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
by: Heck, Sophia, et al.
Published: (2026)

Temporal Graph Reconfiguration for Always-Connected Graphs
by: Sievers, Paul, et al.
Published: (2025)

Minimum Temporal Spanners in Happy Graphs
by: Casteigts, Arnaud, et al.
Published: (2026)

Exploration of Always $S$-Connected Temporal Graphs
by: Adamson, Duncan, et al.
Published: (2026)

Beer Path Problems in Temporal Graphs
by: D'Ascenzo, Andrea, et al.
Published: (2025)

Diameter Shortcut Sets on Temporal Graphs
by: Quantmeyer, Gerome
Published: (2025)

Exploring Word-Representable Temporal Graphs
by: Adamson, Duncan
Published: (2025)

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs
by: Björklund, Andreas, et al.
Published: (2023)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
by: Xu, Zhenxiang, et al.
Published: (2024)

Scalable Similarity Search over Large Attributed Bipartite Graphs
by: Ou, Xi, et al.
Published: (2025)

Exploring Temporal Graphs with Frequent and Regular Edges
by: Adamson, Duncan
Published: (2025)

Optimizing Distances for Multi-Broadcast in Temporal Graphs
by: Carnevale, Daniele, et al.
Published: (2026)

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
by: Ito, Takehiro, et al.
Published: (2025)

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
by: Dogeas, Konstantinos, et al.
Published: (2023)

TGLib: An Open-Source Library for Temporal Graph Analysis
by: Oettershagen, Lutz, et al.
Published: (2022)

Realization of Temporally Connected Graphs Based on Degree Sequences
by: Casteigts, Arnaud, et al.
Published: (2025)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
by: Bhattacharya, Sayan, et al.
Published: (2023)

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
by: Azarmehr, Amir, et al.
Published: (2024)

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
by: Das, Syamantak, et al.
Published: (2024)

From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
by: Bernstein, Aaron, et al.
Published: (2025)

Enumerating m-Length Walks in Directed Graphs with Constant Delay
by: Adamson, Duncan, et al.
Published: (2024)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
by: Conte, Alessio, et al.
Published: (2024)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels
by: Deligkas, Argyrios, et al.
Published: (2021)

A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
by: Kwok, Shawxing
Published: (2025)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
by: Bringmann, Karl, et al.
Published: (2026)

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor
by: Csikós, Mónika, et al.
Published: (2023)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
by: Ding, Xiangyun, et al.
Published: (2025)

Real-World Graph Analysis: Techniques for Static, Dynamic, and Temporal Communities
by: Rucci, Davide
Published: (2024)

On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
by: Chalermsook, Parinya, et al.
Published: (2025)

Foremost, Fastest, Shortest: Temporal Graph Realization under Various Path Metrics
by: Cauvi, Justine, et al.
Published: (2025)

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions
by: Venturin, Giorgio, et al.
Published: (2025)

On Fixed-Parameter Tractability of Weighted 0-1 Timed Matching Problem on Temporal Graphs
by: Kumar, Rinku, et al.
Published: (2025)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
by: Hathcock, Daniel, et al.
Published: (2025)