Imagen de Portada

SSD Set System, Graph Decomposition and Hamiltonian Cycle

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Shota, Kan, Haraguchi, Kazuya
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Discrete Mathematics Combinatorics G.2.1; G.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
por: Adamson, Duncan, et al.
Publicado: (2023)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
por: Nishimura, Yuki, et al.
Publicado: (2025)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
por: Könen, David, et al.
Publicado: (2023)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
por: Bourneuf, Romain, et al.
Publicado: (2025)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
por: Streit, Robert P., et al.
Publicado: (2024)

Lower Bounds for Leaf Rank of Leaf Powers
por: Høgemo, Svein
Publicado: (2024)

Optimal distance query reconstruction for graphs without long induced cycles
por: Bastide, Paul, et al.
Publicado: (2023)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
por: MacRury, Calum, et al.
Publicado: (2022)

Alon-Tarsi Number of Some Regular Graphs
por: Prajnanaswaroopa, S.
Publicado: (2023)

Explicit two-sided unique-neighbor expanders
por: Hsieh, Jun-Ting, et al.
Publicado: (2023)

Efficient Uniform Sampling of Surjections via their Profiles
por: Carayol, Arnaud, et al.
Publicado: (2026)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
por: Ma, Will, et al.
Publicado: (2024)

Online Bipartite Matching in the Probe-Commit Model
por: Borodin, Allan, et al.
Publicado: (2023)

List Coloring of some Cayley graphs using Kernel perfections
por: S, Prajnanaswaroopa
Publicado: (2024)

On Relaxation of Dominant Sets
por: Koster, Max
Publicado: (2022)

Weisfeiler-Leman on graphs of small twin-width
por: Heinrich, Irene, et al.
Publicado: (2026)

Pop Stacks with a Bypass
por: Cioni, Lapo, et al.
Publicado: (2024)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
por: Salas, Jesus
Publicado: (2025)

Color-Constrained Arborescences in Edge-Colored Digraphs
por: Ardra, P. S., et al.
Publicado: (2025)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
por: Eiben, Eduard, et al.
Publicado: (2023)

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
por: Bonnet, Édouard, et al.
Publicado: (2023)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
por: Jacob, Ashwin, et al.
Publicado: (2024)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2026)

Searching in trees with $k$-up-modular cost functions
por: Szyfelbein, Michał
Publicado: (2025)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
por: Ibrahimpur, Sharat, et al.
Publicado: (2025)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
por: Chen, Yijia, et al.
Publicado: (2023)

Breaking the Symmetries of Amenable Graphs
por: Cheng, Christine T.
Publicado: (2025)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
por: Zhong, Xianghui
Publicado: (2019)

New Results on Edge-coloring and Total-coloring of Split Graphs
por: Couto, Fernanda, et al.
Publicado: (2023)

Approximation Algorithms for Correlated Knapsack Orienteering
por: Espinosa, David Aleman, et al.
Publicado: (2024)

Adjacency Labeling Schemes for Small Classes
por: Bonnet, Édouard, et al.
Publicado: (2024)

Deterministic Minimum Steiner Cut in Maximum Flow Time
por: Ding, Matthew, et al.
Publicado: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
por: Ma, Will, et al.
Publicado: (2025)

A polynomial-time algorithm for recognizing high-bandwidth graphs
por: Varona, Luis M. B.
Publicado: (2026)

Random Schreier graphs as expanders
por: Caillat-Grenier, Geoffroy
Publicado: (2023)

Better Approximation for Weighted $k$-Matroid Intersection
por: Singer, Neta, et al.
Publicado: (2024)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
por: Bom, David, et al.
Publicado: (2025)

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
por: Baruchel, Thomas
Publicado: (2025)

Interval Graphs are Reconstructible
por: Heinrich, Irene, et al.
Publicado: (2025)