Fast Rational Search via Stern-Brocot Tree

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Weyers, Connor, Vinodchandran, N. V.
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
by: Scheinerman, Danny
Published: (2024)

A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order
by: Glover, Charles N.
Published: (2024)

Fast and Simple $(1+ε)Δ$-Edge-Coloring of Dense Graphs
by: Dhawan, Abhishek
Published: (2024)

Computing Tree Decompositions with Small Independence Number
by: Dallard, Clément, et al.
Published: (2022)

Succinct Encodings of Binary Trees with Application to AVL Trees
by: Chizewer, Jeremy, et al.
Published: (2023)

Fast Mixing in Sparse Random Ising Models
by: Liu, Kuikui, et al.
Published: (2024)

On Circular Threshold Words and Other Stronger Versions of Dejean's conjecture
by: Tunev, Igor N.
Published: (2025)

Lower Bounds on Tree Covers
by: Chen, Yu, et al.
Published: (2025)

Counting Permutation Patterns with Multidimensional Trees
by: Beniamini, Gal, et al.
Published: (2024)

Finding Spanning Trees with Perfect Matchings
by: Bérczi, Kristóf, et al.
Published: (2024)

Connected Partitions via Connected Dominating Sets
by: Niklanovits, Aikaterini, et al.
Published: (2025)

A faster algorithm for Vertex Cover parameterized by solution size
by: Harris, David G., et al.
Published: (2022)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
by: Bai, Yuhang, et al.
Published: (2026)

A Unified View of Graph Regularity via Matrix Decompositions
by: Bodwin, Greg, et al.
Published: (2019)

Analysis of a Random Local Search Algorithm for Dominating Set
by: Higl, Hendrik
Published: (2026)

Improved space-time tradeoff for TSP via extremal set systems
by: Dallant, Justin, et al.
Published: (2026)

Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
by: Karamchedu, Mithra, et al.
Published: (2025)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
by: Korhonen, Tuukka
Published: (2024)

Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz--Parisi Potential
by: Koehler, Frederic, et al.
Published: (2025)

A Fast Coloring Oracle for Average Case Hypergraphs
by: Marcussen, Cassandra, et al.
Published: (2025)

Thin Trees via $k$-Respecting Cut Identities
by: Daga, Mohit
Published: (2025)

Testing H-freeness on sparse graphs, the case of bounded expansion
by: Humeau, Samuel, et al.
Published: (2025)

Liar's vertex-edge domination in unit disk graph
by: Bhattacharya, Debojyoti, et al.
Published: (2025)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
by: Jones, Mark, et al.
Published: (2025)

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

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
by: Biedl, Therese
Published: (2025)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
by: Daga, Mohit
Published: (2025)

Optimal Bounds for Open Addressing Without Reordering
by: Farach-Colton, Martin, et al.
Published: (2025)

Unweighted One-Sided Code Sparsifiers and Thin Subgraphs
by: Gharan, Shayan Oveis, et al.
Published: (2025)

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
by: Madani, Amirali, et al.
Published: (2025)

A Combinatorial Characterization of Constant Mixing Time
by: Lau, Lap Chi, et al.
Published: (2025)

A note on Ordered Ruzsa-Szemerédi graphs
by: Pratt, Kevin
Published: (2025)

Cutwidth and Crossings
by: Rauch, Johannes, et al.
Published: (2025)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
by: Gavva, Surya Teja, et al.
Published: (2025)

Polynomial Property Testing
by: Gishboliner, Lior, et al.
Published: (2025)

Faithful universal graphs for minor-closed classes
by: Bastide, Paul, et al.
Published: (2025)

Short circuit walks in fixed dimension
by: Black, Alexander E., et al.
Published: (2025)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
by: Chalopin, Jérémie, et al.
Published: (2025)

A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
by: Xiao, Hanyin, et al.
Published: (2025)

Faster diameter computation in graphs of bounded Euler genus
by: Kluk, Kacper, et al.
Published: (2025)