Imagen de Portada

Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Siyue, Silina, Olha
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

A Better-Than-2 Approximation for the Directed Tree Augmentation Problem
por: Neuwohner, Meike, et al.
Publicado: (2025)

Connected Partitions via Connected Dominating Sets
por: Niklanovits, Aikaterini, et al.
Publicado: (2025)

Space Complexity of Vertex Connectivity Oracles
por: Pettie, Seth, et al.
Publicado: (2022)

On the Congruency-Constrained Matroid Base
por: Liu, Siyue, et al.
Publicado: (2023)

Ghost Value Augmentation for $k$-Edge-Connectivity
por: Hershkowitz, D Ellis, et al.
Publicado: (2023)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
por: Biedl, Therese, et al.
Publicado: (2024)

A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications
por: Dumitrescu, Adrian
Publicado: (2024)

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
por: Kita, Nanano
Publicado: (2025)

Constructing disjoint Steiner trees in Sierpiński graphs
por: Yang, Chenxu, et al.
Publicado: (2023)

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

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

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

Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up
por: Kuszmaul, William, et al.
Publicado: (2025)

The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
por: Feghali, Carl, et al.
Publicado: (2025)

The Strong Birthday Problem Revisited
por: Tripathy, Chijul B.
Publicado: (2025)

Min-Max Connected Multiway Cut
por: Tiwary, Hans Raj, et al.
Publicado: (2026)

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

On Computing Vertex Connectivity of 1-Plane Graphs
por: Biedl, Therese, et al.
Publicado: (2022)

Complexity and Algorithm for the Matching vertex-cutset Problem
por: Li, Hengzhe, et al.
Publicado: (2025)

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
por: Kuhlmann, Stefan, et al.
Publicado: (2025)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
por: Deligkas, Argyrios, et al.
Publicado: (2025)

Lower Bounds for Greedy Teaching Set Constructions
por: Compton, Spencer, et al.
Publicado: (2025)

Strong spatial mixing for colorings on trees and its algorithmic applications
por: Chen, Zongchen, et al.
Publicado: (2023)

Improved Upper Bounds for the Directed Flow-Cut Gap
por: Bodwin, Greg, et al.
Publicado: (2026)

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs
por: Fang, Qiming, et al.
Publicado: (2026)

Optimising Cylindrical Algebraic Coverings for use in SMT by Solving a Set Covering Problem with Reasons
por: Babatunde, Abiola, et al.
Publicado: (2026)

Sampling Colorings with Fixed Color Class Sizes
por: Kuchukova, Aiya, et al.
Publicado: (2026)

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
por: Clifford, Peter, et al.
Publicado: (2026)

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

On Occurrence-Preserving Morphisms
por: Kishi, Kaisei, et al.
Publicado: (2026)

Treewidth of the $n \times n$ toroidal grid
por: Gima, Tatsuya, et al.
Publicado: (2026)

Better approximation guarantee for Asymmetric TSP
por: Vygen, Jens
Publicado: (2026)

On the complexity of edge subdivision to $H$-free graphs
por: Piecyk, Marta, et al.
Publicado: (2026)

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

A Linear-Time Algorithm for Finding an Odd Cycle Through Two Specified Vertices
por: Kano, Takumi, et al.
Publicado: (2026)

An algorithmic Polynomial Freiman-Ruzsa theorem
por: Castro-Silva, Davi, et al.
Publicado: (2026)

Representative set statements for delta-matroids and the Mader delta-matroid
por: Wahlström, Magnus
Publicado: (2023)

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

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