:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Xiao, Hanyin, Zhang, Jiaming, Zhang, Zhikang, Li, Weidong
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Combinatorics
Accès en ligne:	https://arxiv.org/abs/2502.09412
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Parameterised algorithms for temporally satisfying reconfiguration problems
par: Davot, Tom, et autres
Publié: (2025)

A faster algorithm for Vertex Cover parameterized by solution size
par: Harris, David G., et autres
Publié: (2022)

An algorithmic Polynomial Freiman-Ruzsa theorem
par: Castro-Silva, Davi, et autres
Publié: (2026)

A fast algorithm for the Frobenius problem in three variables
par: Rosin, Daniel
Publié: (2025)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
par: Chalopin, Jérémie, et autres
Publié: (2025)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
par: Arkhipov, Pavel, et autres
Publié: (2024)

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

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

Algorithmic study on liar's vertex-edge domination problem
par: Bhattacharya, Debojyoti, et autres
Publié: (2023)

On 2-strong connectivity orientations of mixed graphs and related problems
par: Georgiadis, Loukas, et autres
Publié: (2023)

Paths and Intersections: Exact Emulators for Planar Graphs
par: Li, George Z., et autres
Publié: (2025)

A rounding and clustering-based exact algorithm for the p-center problem
par: Ales, Zacharie, et autres
Publié: (2024)

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
par: Oum, Sang-il, et autres
Publié: (2026)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
par: Gavva, Surya Teja, et autres
Publié: (2025)

Online facility location with weights and congestion
par: Chakraborty, Arghya, et autres
Publié: (2022)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
par: Bernshteyn, Anton, et autres
Publié: (2024)

Efficient algorithms for the Potts model on small-set expanders
par: Carlson, Charles, et autres
Publié: (2020)

Sparsifying Cayley Graphs on Every Group
par: Hsieh, Jun-Ting, et autres
Publié: (2025)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
par: Deák, Bence, et autres
Publié: (2026)

Generalising the maximum independent set algorithm via Boolean networks
par: Gadouleau, Maximilien, et autres
Publié: (2024)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
par: Alecu, Bogdan, et autres
Publié: (2024)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
par: Korhonen, Tuukka, et autres
Publié: (2024)

A Θ(m^9) ternary minimum-cost network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems
par: Diaby, Moustapha
Publié: (2016)

Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs"
par: Krawczyk, Tomasz
Publié: (2024)

Complexity and Algorithm for the Matching vertex-cutset Problem
par: Li, Hengzhe, et autres
Publié: (2025)

On the complexity of global Roman domination problem in graphs
par: Reddy, Sangam Balchandar, et autres
Publié: (2026)

Constructing disjoint Steiner trees in Sierpiński graphs
par: Yang, Chenxu, et autres
Publié: (2023)

A Note on Generic Tangle Algorithms
par: Elbracht, Christian, et autres
Publié: (2020)

Enumerating minimal solution sets for metric graph problems
par: Bergougnoux, Benjamin, et autres
Publié: (2023)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
par: An, Shinwoo, et autres
Publié: (2025)

A Combinatorial Characterization of Constant Mixing Time
par: Lau, Lap Chi, et autres
Publié: (2025)

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

A Lower Bound for the Max Entropy Algorithm for TSP
par: Jin, Billy, et autres
Publié: (2023)

A Faster Deterministic Approximation Algorithm for TTP-2
par: Kanaya, Yuga, et autres
Publié: (2023)

A Maximum Linear Arrangement Problem on Directed Graphs
par: DeVos, Matt, et autres
Publié: (2018)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
par: Kuszmaul, William
Publié: (2025)

A Unified View of Graph Regularity via Matrix Decompositions
par: Bodwin, Greg, et autres
Publié: (2019)

A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications
par: Dumitrescu, Adrian
Publié: (2024)

A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three
par: Chalermsook, Parinya, et autres
Publié: (2025)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
par: Dhawan, Abhishek
Publié: (2024)