Image de couverture de livre

Identifying bubble-like subgraphs in linear-time via a unified SPQR-tree framework

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sena, Francisco, Politov, Aleksandr, Moumard, Corentin, Cairo, Massimo, Rizzi, Romeo, Cáceres, Manuel, Schmidt, Sebastian, Harviainen, Juha, Tomescu, Alexandru I.
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

Identifying all snarls and superbubbles in linear-time, via a unified SPQR-tree framework
par: Sena, Francisco, et autres
Publié: (2025)

The Power of Graph Doubling: Computing Ultrabubbles in a Bidirected Graph by Reducing to Weak Superbubbles
par: Schmidt, Sebastian, et autres
Publié: (2026)

Safe Sequences via Dominators in DAGs for Path-Covering Problems
par: Sena, Francisco, et autres
Publié: (2024)

Fast and Flexible Flow Decompositions in General Graphs via Dominators
par: Sena, Francisco, et autres
Publié: (2025)

Graph Reconstruction with a Connected Components Oracle
par: Harviainen, Juha, et autres
Publié: (2025)

Quantum Speedups for Bayesian Network Structure Learning
par: Harviainen, Juha, et autres
Publié: (2023)

Maximum Coverage $k$-Antichains and Chains: A Greedy Approach
par: Cáceres, Manuel, et autres
Publié: (2025)

Exact and Approximate Algorithms for Polytree Learning
par: Harviainen, Juha, et autres
Publié: (2026)

Linear-Time Safe-Alternating DFS and SCCs
par: Comin, Carlo, et autres
Publié: (2016)

Width Parameters for Minimum Flow Decomposition
par: Grigorjew, Andreas, et autres
Publié: (2024)

Solving the Probabilistic Profitable Tour Problem on a Tree
par: Angelelli, Enrico, et autres
Publié: (2022)

Ritualistic Games, Boundary Control, and Information Uncertainty
par: Harviainen, J. Tuomas
Publié: (2012)

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
par: Tsin, Yung H.
Publié: (2023)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
par: Lokshtanov, Daniel, et autres
Publié: (2026)

Generalizing Roberts' characterization of unit interval graphs
par: Martínez, Virginia Ardévol, et autres
Publié: (2024)

Fair densest subgraph across multiple graphs
par: Arachchi, Chamalee Wickrama, et autres
Publié: (2025)

Testing whether a subgraph is convex or isometric
par: Cabello, Sergio
Publié: (2025)

Cover time of random subgraphs of the hypercube
par: Cooper, Colin, et autres
Publié: (2025)

Expansion in supercritical random subgraphs of expanders and its consequences
par: Sahar Diskin, et autres
Publié: (2024)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
par: Hochbaum, Dorit S.
Publié: (2024)

Compression with wildcards: All induced metric subgraphs
par: Wild, Marcel
Publié: (2024)

A customizable inexact subgraph matching algorithm for attributed graphs
par: Benko, Tatyana, et autres
Publié: (2025)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
par: Tu, Sijing, et autres
Publié: (2025)

Large induced subgraphs of random graphs with given degree sequences
par: Angus Southwell, et autres
Publié: (2024)

Minimum projective linearizations of trees in linear time
par: Alemany-Puig, Lluís, et autres
Publié: (2021)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
par: Bodlaender, Hans L., et autres
Publié: (2025)

On the typical structure of graphs not containing a fixed vertex‐critical subgraph
par: Oren Engelberg, et autres
Publié: (2024)

Largest common subgraph of two forests
par: Rautenbach, Dieter, et autres
Publié: (2024)

On the instance optimality of detecting collisions and subgraphs
par: Ben-Eliezer, Omri, et autres
Publié: (2023)

The Pier Luigi Nervi's concrete structure of Palazzetto dello Sport: Modeling and dynamic characterization
par: Jacopo Ciambella, et autres
Publié: (2024)

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
par: Enright, Jessica, et autres
Publié: (2020)

QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
par: Bonnet, Édouard, et autres
Publié: (2026)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
par: Jaberi, Raed, et autres
Publié: (2024)

Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules
par: He, Xi, et autres
Publié: (2025)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
par: Chudnovsky, Maria, et autres
Publié: (2024)

Local certification of forbidden subgraphs
par: Bousquet, Nicolas, et autres
Publié: (2024)

Fast algorithms for complex-valued discrete Fourier transform with separate real and imaginary inputs/outputs
par: Cariow, Aleksandr
Publié: (2025)

Quality of life at work and its relationship with engagement
par: Claudia Alejandra l Toscano-deCairo
Publié: (2020)

Mass Generation as Structural Stabilization in the Theory of Structural Articulation (TSA): The Higgs Case
par: Nett, Aleksandr
Publié: (2026)

Mass Generation as Structural Stabilization in the Theory of Structural Articulation (TSA): The Higgs Case
par: Nett, Aleksandr
Publié: (2026)