Image de couverture de livre

Optimal Generation of Strictly Increasing Binary Trees and Beyond

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bodini, Olivier, Durand, Francis, Marchal, Philippe
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
par: Efthymiou, Charilaos, et autres
Publié: (2023)

Approximation Algorithms for Optimal Hopsets
par: Dinitz, Michael, et autres
Publié: (2025)

Edge Clique Partition and Cover Beyond Independence
par: Fomin, Fedor V., et autres
Publié: (2025)

Optimal Padded Decomposition For Bounded Treewidth Graphs
par: Filtser, Arnold, et autres
Publié: (2024)

Optimal Enumeration of Eulerian Trails in Directed Graphs
par: Bals, Ben, et autres
Publié: (2026)

Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents
par: Georgiou, Konstantinos, et autres
Publié: (2025)

Placing Green Bridges Optimally for Robust Habitat Reconnection
par: Ellmies, Gero, et autres
Publié: (2026)

Explicit Min-wise Hash Families with Optimal Size
par: Chen, Xue, et autres
Publié: (2025)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
par: Harada, Tsubasa, et autres
Publié: (2024)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
par: Gahlawat, Harmender, et autres
Publié: (2025)

Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
par: Baswana, Surender, et autres
Publié: (2023)

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
par: Dutta, Kunal, et autres
Publié: (2026)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
par: Carlson, Charlie, et autres
Publié: (2024)

Greedy Gray Codes for some Restricted Classes of Binary Words
par: Hassler, Nathanaël, et autres
Publié: (2024)

An Approximate Generalization of the Okamura-Seymour Theorem
par: Kumar, Nikhil
Publié: (2022)

Simultaneous Drawing of Layered Trees
par: Katheder, Julia, et autres
Publié: (2023)

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

Generation of weighted trees, block trees and block graphs
par: Ekim, Tınaz, et autres
Publié: (2024)

Polynomial Kernels for Spanning Tree with Diversity Requirements
par: Golovach, Petr A., et autres
Publié: (2026)

Approximation of Spanning Tree Congestion using Hereditary Bisection
par: Kolman, Petr
Publié: (2024)

Revisiting Tree Isomorphism: An Algorithmic Bric-à-Brac
par: Ingels, Florian
Publié: (2023)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
par: Foucaud, Florent, et autres
Publié: (2026)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
par: Disser, Yann, et autres
Publié: (2024)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
par: Abbasi, Ali, et autres
Publié: (2026)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
par: Marx, Dániel, et autres
Publié: (2026)

Isomorphism Testing Parameterized by Genus and Beyond
par: Neuen, Daniel
Publié: (2021)

Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings
par: Brlek, Srečko, et autres
Publié: (2024)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
par: Liu, Bowie, et autres
Publié: (2025)

The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2
par: Byrka, Jarosław, et autres
Publié: (2024)

Optimal and Efficient Partite Decompositions of Hypergraphs
par: Krapivin, Andrew, et autres
Publié: (2025)

Towards an Optimal Contention Resolution Scheme for Matchings
par: Nuti, Pranav, et autres
Publié: (2022)

An Alternate Proof of Near-Optimal Light Spanners
par: Bodwin, Greg
Publié: (2023)

Sampling Tree-Weighted Partitions Without Sampling Trees
par: Cannon, Sarah, et autres
Publié: (2025)

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
par: Tan, Jingjing
Publié: (2024)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
par: Harada, Tsubasa
Publié: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Circular-arc graphs and the Helly property
par: Derbisz, Jan, et autres
Publié: (2024)

Parameterized Saga of First-Fit and Last-Fit Coloring
par: Agrawal, Akanksha, et autres
Publié: (2024)

Detecting Disjoint Shortest Paths in Linear Time and More
par: Akmal, Shyan, et autres
Publié: (2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
par: Wang, Chen, et autres
Publié: (2024)