Image de couverture de livre

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kiran, Mekala, Das, Apurba, Banerjee, Suman, Ray, Tathagata
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Multi-core & GPU-based Balanced Butterfly Counting in Signed Bipartite Graphs
par: Kiran, Mekala, et autres
Publié: (2026)

New results for the detection of bicliques
par: Manoussakis, George
Publié: (2024)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
par: Cai, Xinwei, et autres
Publié: (2023)

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
par: Meng, Lingkai, et autres
Publié: (2024)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
par: Ye, Xiaowei, et autres
Publié: (2024)

Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs
par: Das, Syamantak, et autres
Publié: (2024)

Finding the Balance Rate of Uncertain Signed Graphs
par: Wang, Zeyu, et autres
Publié: (2026)

Biclique Reconfiguration in Bipartite Graphs
par: Otachi, Yota, et autres
Publié: (2026)

Online Sparsification of Bipartite-Like Clusters in Graphs
par: Das, Joyentanuj, et autres
Publié: (2025)

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs
par: Björklund, Andreas, et autres
Publié: (2023)

Efficient Kernelization Algorithm for Bipartite Graph Matching
par: Wu, Guang, et autres
Publié: (2024)

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
par: Ito, Takehiro, et autres
Publié: (2025)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
par: Adamson, Duncan, et autres
Publié: (2025)

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
par: Zhou, Alexander, et autres
Publié: (2026)

Scalable Similarity Search over Large Attributed Bipartite Graphs
par: Ou, Xi, et autres
Publié: (2025)

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
par: Azarmehr, Amir, et autres
Publié: (2024)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Multi-Slot Tag Assignment Problem in Billboard Advertisement
par: Ali, Dildar, et autres
Publié: (2024)

A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
par: Kwok, Shawxing
Publié: (2025)

On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
par: Chalermsook, Parinya, et autres
Publié: (2025)

Scalable Multilevel and Memetic Signed Graph Clustering
par: Hausberger, Felix, et autres
Publié: (2022)

From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
par: Bernstein, Aaron, et autres
Publié: (2025)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
par: Hathcock, Daniel, et autres
Publié: (2025)

From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
par: Döring, Simon, et autres
Publié: (2024)

Influential Slot and Tag Selection in Billboard Advertisement
par: Ali, Dildar, et autres
Publié: (2024)

Multi-product Influence Maximization in Billboard Advertisement
par: Ali, Dildar, et autres
Publié: (2025)

Deterministic Online Bipartite Edge Coloring
par: Blikstad, Joakim, et autres
Publié: (2024)

Counting Patterns in Degenerate Graphs in Constant Space
par: Komarath, Balagopal, et autres
Publié: (2025)

A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three
par: Chalermsook, Parinya, et autres
Publié: (2025)

Near-Optimal Four-Cycle Counting in Graph Streams
par: Lüderssen, Sebastian, et autres
Publié: (2026)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
par: Hebert-Johnson, Ursula, et autres
Publié: (2023)

Estimating Diffusion Degree on Graph Streams
par: Gore, Vinit Ramesh, et autres
Publié: (2024)

Interval-Constrained Bipartite Matching over Time
par: Abels, Andreas, et autres
Publié: (2024)

Optimal Rounding for Two-Stage Bipartite Matching
par: Pollner, Tristan, et autres
Publié: (2025)

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs
par: Misra, Neeldhara, et autres
Publié: (2022)

On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope
par: Nägele, Martin, et autres
Publié: (2026)

$O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
par: Soma, Tasuku, et autres
Publié: (2025)

Approximate Bipartite $b$-Matching using Multiplicative Auction
par: Samineni, Bhargav, et autres
Publié: (2024)

Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
par: Joseph, et autres
Publié: (2023)

Colorful Vertex Recoloring of Bipartite Graphs
par: Patt-Shamir, Boaz, et autres
Publié: (2025)