Image de couverture de livre

On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Mukhopadhyay, Asish, John, Daniel, Sarweh, Lucas
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Combinatorics E.1; F.2; G.4
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Weisfeiler-Leman on graphs of small twin-width
par: Heinrich, Irene, et autres
Publié: (2026)

New Entropy Measures for Tries with Applications to the XBWT
par: Carfagna, Lorenzo, et autres
Publié: (2025)

An $n^{O(\log\log n)}$ time approximation scheme for capacitated VRP in the Euclidean plane
par: Sitters, René
Publié: (2025)

A (Weakly) Polynomial Algorithm for AIVF Coding
par: Dolatabadi, Reza Hosseini, et autres
Publié: (2024)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
par: Kumar, Nikhil, et autres
Publié: (2025)

Better Approximation for Weighted $k$-Matroid Intersection
par: Singer, Neta, et autres
Publié: (2024)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
par: Dolatabadi, Reza Hosseini, et autres
Publié: (2024)

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

Faster shortest-path algorithms using the acyclic-connected tree
par: Stefansson, Elis, et autres
Publié: (2025)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Constant-Factor Distortion Mechanisms for $k$-Committee Election
par: Pulyassary, Haripriya, et autres
Publié: (2025)

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
par: Chen, Yijia, et autres
Publié: (2023)

Exploration of $k$-edge-deficient temporal graphs in linear time
par: Lahtin, Ivan, et autres
Publié: (2026)

On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
par: Krawczyk, Tomasz
Publié: (2024)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
par: Bushnell, Brian
Publié: (2026)

On $k$-connectivity oracles in $k$-connected graphs
par: Nutov, Zeev
Publié: (2026)

Optimal Preprocessing for Answering On-Line Product Queries
par: Alon, Noga, et autres
Publié: (2024)

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
par: Brodal, Gerth Stølting
Publié: (2024)

Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores
par: Garg, Ishant
Publié: (2026)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
par: Randolph, Tim, et autres
Publié: (2024)

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
par: Baruchel, Thomas
Publié: (2025)

O(1) Insertion for Random Walk d-ary Cuckoo Hashing up to the Load Threshold
par: Bell, Tolson, et autres
Publié: (2024)

Reserve Matching with Thresholds
par: Evren, Suat
Publié: (2023)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
par: Kanellopoulos, Sotiris, et autres
Publié: (2025)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
par: Ma, Will, et autres
Publié: (2024)

Online Bipartite Matching in the Probe-Commit Model
par: Borodin, Allan, et autres
Publié: (2023)

Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
par: Mukherjee, Sayan, et autres
Publié: (2025)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
par: MacRury, Calum, et autres
Publié: (2022)

On the satisfability of random k-Horn formulae
par: Istrate, Gabriel
Publié: (2000)

Restless reachability problems in temporal graphs
par: Thejaswi, Suhas, et autres
Publié: (2020)

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

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
par: Bläsius, Thomas, et autres
Publié: (2024)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
par: Gillman, David, et autres
Publié: (2025)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
par: Streit, Robert P., et autres
Publié: (2024)

The Minimum Subgraph Complementation Problem
par: Gutiérrez, Juan, et autres
Publié: (2025)

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

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
par: Heimann, Sophia, et autres
Publié: (2026)

Better coloring of 3-colorable graphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
par: Heimann, Sophia, et autres
Publié: (2024)