Image de couverture de livre

Cutwidth and Crossings

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rauch, Johannes, Rautenbach, Dieter
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Induced Subforests and Superforests
par: Rautenbach, Dieter, et autres
Publié: (2024)

Largest common subgraph of two forests
par: Rautenbach, Dieter, et autres
Publié: (2024)

On Approximating Cutwidth and Pathwidth
par: Bansal, Nikhil, et autres
Publié: (2023)

weberknecht -- a One-Sided Crossing Minimization solver
par: Rauch, Johannes
Publié: (2024)

Colouring Probe $H$-Free Graphs
par: Paulusma, Daniël, et autres
Publié: (2025)

A Faster Algorithm for Independent Cut
par: Chernyshev, Vsevolod, et autres
Publié: (2025)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
par: Biedl, Therese, et autres
Publié: (2024)

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
par: Casel, Katrin, et autres
Publié: (2019)

Cutwidth Bounds via Vertex Partitions
par: Amarilli, Antoine, et autres
Publié: (2025)

GridOT -- a discrete optimal transport solver on grids
par: Rauch, Johannes, et autres
Publié: (2025)

Computing Subset Vertex Covers in $H$-Free Graphs
par: Brettell, Nick, et autres
Publié: (2023)

Testing H-freeness on sparse graphs, the case of bounded expansion
par: Humeau, Samuel, et autres
Publié: (2025)

Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
par: Karamchedu, Mithra, et autres
Publié: (2025)

Liar's vertex-edge domination in unit disk graph
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
par: Jones, Mark, et autres
Publié: (2025)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
par: Hathcock, Daniel, et autres
Publié: (2025)

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)

Optimal Bounds for Open Addressing Without Reordering
par: Farach-Colton, Martin, et autres
Publié: (2025)

Unweighted One-Sided Code Sparsifiers and Thin Subgraphs
par: Gharan, Shayan Oveis, et autres
Publié: (2025)

Connected Partitions via Connected Dominating Sets
par: Niklanovits, Aikaterini, et autres
Publié: (2025)

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
par: Madani, Amirali, 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)

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

Polynomial Property Testing
par: Gishboliner, Lior, et autres
Publié: (2025)

Faithful universal graphs for minor-closed classes
par: Bastide, Paul, et autres
Publié: (2025)

Short circuit walks in fixed dimension
par: Black, Alexander E., et autres
Publié: (2025)

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

A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
par: Xiao, Hanyin, et autres
Publié: (2025)

Faster diameter computation in graphs of bounded Euler genus
par: Kluk, Kacper, et autres
Publié: (2025)

Lower bounds on collective additive spanners
par: Corneil, Derek G., et autres
Publié: (2025)

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

Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up
par: Kuszmaul, William, et autres
Publié: (2025)

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

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

Finding the diameter of a tree with distance queries
par: Gerbner, Dániel, et autres
Publié: (2025)

Fast Rational Search via Stern-Brocot Tree
par: Weyers, Connor, et autres
Publié: (2025)

On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
par: Chalermsook, Parinya, et autres
Publié: (2025)

Kernelization for list $H$-coloring for graphs with small vertex cover
par: Piecyk, Marta, et autres
Publié: (2025)