Imagen de Portada

New results for the detection of bicliques

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Manoussakis, George
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive
por: Manoussakis, George
Publicado: (2019)

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

New algorithms for girth and cycle detection
por: Roditty, Liam, et al.
Publicado: (2025)

BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs
por: Baudin, Alexis, et al.
Publicado: (2024)

C*: A New Bounding Approach for the Moving-Target Traveling Salesman Problem
por: Philip, Allen George, et al.
Publicado: (2023)

Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
por: Canonne, Clément L., et al.
Publicado: (2025)

Optimally detecting uniformly-distributed $\ell_2$ heavy hitters in data streams
por: Velusamy, Santhoshini, et al.
Publicado: (2025)

Classes Testable with $O(1/ε)$ Queries for Small $ε$ Independent of the Number of Variables
por: Bshouty, Nader H., et al.
Publicado: (2026)

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

Parameterized Complexity of MinCSP over the Point Algebra
por: Osipov, George, et al.
Publicado: (2023)

Temporal Routing in Static Networks: The Schedule Completion Problem
por: Döring, Michelle, et al.
Publicado: (2026)

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

Bellman-Ford in Almost-Linear Time for Dense Graphs
por: Li, George Z., et al.
Publicado: (2026)

Improved Directed Expander Decompositions
por: Fleischmann, Henry, et al.
Publicado: (2025)

Faster Weak Expander Decompositions and Approximate Max Flow
por: Fleischmann, Henry, et al.
Publicado: (2025)

New weighted additive spanners
por: La, An, et al.
Publicado: (2024)

New Greedy Spanners and Applications
por: Popova, Elizaveta, et al.
Publicado: (2026)

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
por: Baguley, Samuel, et al.
Publicado: (2024)

Dynamic Network Discovery via Infection Tracing
por: Bals, Ben, et al.
Publicado: (2024)

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

Last Truck Scheduling for Middle-mile Next-day Delivery Coverage
por: Benidis, Konstantinos, et al.
Publicado: (2023)

New approximate distance oracles and their applications
por: Kadria, Avi, et al.
Publicado: (2025)

New and Improved Bounds for Markov Paging
por: Pabbaraju, Chirag, et al.
Publicado: (2025)

New Bounds for Circular Trace Reconstruction
por: Burudgunte, Arnav, et al.
Publicado: (2025)

Testing Sparse Functions over the Reals
por: Arora, Vipul, et al.
Publicado: (2026)

Shortcutting for Negative-Weight Shortest Path
por: Li, George Z., et al.
Publicado: (2025)

New Algorithm for Combinatorial $n$-folds and Applications
por: Jansen, Klaus, et al.
Publicado: (2024)

Efficient Algorithms and New Characterizations for CSP Sparsification
por: Khanna, Sanjeev, et al.
Publicado: (2024)

New Algorithms and Lower Bounds for Streaming Tournaments
por: Ghosh, Prantar, et al.
Publicado: (2024)

New Separations and Reductions for Directed Preservers and Hopsets
por: Hoppenworth, Gary, et al.
Publicado: (2024)

New Algorithms and Hardness Results for Connected Clustering
por: Eube, Jan, et al.
Publicado: (2025)

New Approximation Guarantees for The Inventory Staggering Problem
por: Alon, Noga, et al.
Publicado: (2025)

New Algorithms for #2-SAT and #3-SAT
por: Peng, Junqiang, et al.
Publicado: (2025)

New Prophet Inequalities via Poissonization and Sharding
por: Harb, Elfarouk
Publicado: (2023)

Realizing temporal transportation trees
por: Mertzios, George B., et al.
Publicado: (2024)

Maximizing Reachability via Shifting of Temporal Paths
por: Deligkas, Argyrios, et al.
Publicado: (2026)

A New Approach for Approximating Directed Rooted Networks
por: Cohen, Sarel, et al.
Publicado: (2024)

New Structures and Algorithms for Length-Constrained Expander Decompositions
por: Haeupler, Bernhard, et al.
Publicado: (2024)

New Diameter Approximations via Distance Oracle Techniques
por: Kirkpatrick, Yael, et al.
Publicado: (2026)

New Oracles and Labeling Schemes for Vertex Cut Queries
por: Jiang, Yonggang, et al.
Publicado: (2025)