Cover Image

Ultrabubble enumeration via a lowest common ancestor approach

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zisis, Athanasios E., Sætrom, Pål
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Power of Graph Doubling: Computing Ultrabubbles in a Bidirected Graph by Reducing to Weak Superbubbles
by: Schmidt, Sebastian, et al.
Published: (2026)

Linear-space LCS enumeration with quadratic-time delay for two strings
by: Sakai, Yoshifumi
Published: (2025)

Constant time enumeration of perfect bipartite matchings
by: Fink, Jiří
Published: (2025)

On the enumeration of signatures of XOR-CNF's
by: Creignou, Nadia, et al.
Published: (2024)

Constant delay Gray code enumeration of ideals and antichains in posets
by: Brenner, Sofia, et al.
Published: (2026)

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
by: Enright, Jessica, et al.
Published: (2020)

Algorithms and Complexity of Hedge Cluster Deletion Problems
by: Konstantinidis, Athanasios L., et al.
Published: (2025)

Efficient algorithm for linear diophantine equations in two variables
by: Deora, Mayank, et al.
Published: (2025)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
by: Xiao, Chenglong, et al.
Published: (2024)

Similarity analysis of DNA sequences through local distribution of nucleotides in strategic neighborhood
by: Mondal, Probir, et al.
Published: (2023)

Online Drone Scheduling for Last-mile Delivery
by: Jana, Saswata, et al.
Published: (2024)

Efficient Trace Frequency Queries in Sparse Graphs
by: Awofeso, Christine, et al.
Published: (2025)

Towards an algebraic approach to the reconfiguration CSP
by: Kimura, Kei
Published: (2025)

Symmetry-breaking symmetry in directed spectral partitioning
by: Pasadakis, Dimosthenis, et al.
Published: (2025)

Approximate $2$-hop neighborhoods on incremental graphs: An efficient lazy approach
by: Becchetti, Luca, et al.
Published: (2025)

OrderedCuts: A new approach for computing Gomory-Hu tree
by: Kolmogorov, Vladimir
Published: (2022)

Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders
by: Liu, Bowie, et al.
Published: (2024)

Operational research approaches and mathematical models for kidney exchange: A literature survey and empirical evaluation
by: Barkel, Mathijs, et al.
Published: (2025)

Switching Classes: Characterization and Computation
by: Antony, Dhanyamol, et al.
Published: (2024)

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
by: Crane, Alex, et al.
Published: (2026)

Efficient Matroid Intersection via a Batch-Update Auction Algorithm
by: Blikstad, Joakim, et al.
Published: (2024)

Validating a PTAS for Triangle-Free 2-Matching via a Simple Decomposition Theorem
by: Kobayashi, Yusuke, et al.
Published: (2024)

Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis
by: Lindermayr, Alexander, et al.
Published: (2026)

Identifying bubble-like subgraphs in linear-time via a unified SPQR-tree framework
by: Sena, Francisco, et al.
Published: (2026)

Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm
by: Chuzhoy, Julia, et al.
Published: (2024)

Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method
by: Liu, Yang P.
Published: (2025)

Matroid Secretary via Labeling Schemes
by: Bérczi, Kristóf, et al.
Published: (2024)

Search Trees on Trees via LP
by: Sadeh, Yaniv, et al.
Published: (2025)

Minimizing the Minimizers via Alphabet Reordering
by: Verbeek, Hilde, et al.
Published: (2024)

Suffix sorting via matching statistics
by: Lipták, Zsuzsanna, et al.
Published: (2022)

Boundaried Kernelization via Representative Sets
by: Antipov, Leonid, et al.
Published: (2025)

Commitment Gap via Correlation Gap
by: Chawla, Shuchi, et al.
Published: (2025)

Bootstrapping Dynamic APSP via Sparsification
by: Kyng, Rasmus, et al.
Published: (2024)

Graph Reconstruction via MIS Queries
by: Konrad, Christian, et al.
Published: (2024)

Largest common subgraph of two forests
by: Rautenbach, Dieter, et al.
Published: (2024)

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

Lawler-Moore Speedups via Additive Combinatorics
by: Bringmann, Karl, et al.
Published: (2026)

Sum Estimation via Vector Similarity Search
by: Mussmann, Stephen, et al.
Published: (2026)

$k$-Clustering via Iterative Randomized Rounding
by: Byrka, Jarosław, et al.
Published: (2026)

Proportionally Fair Matching via Randomized Rounding
by: Duppala, Sharmila, et al.
Published: (2024)