Imagen de Portada

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Crane, Alex, Drange, Pål Grønås, Friedman, Eli, Hovland, Paul D., Hückelheim, Jan, Lyons, Andrew, Mizutani, Yosuke, Ottavy, Macéo, Sullivan, Blair D.
Formato:	Preprint
Publicado:	2026
Materias:	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

Structural Optimal Jacobian Accumulation and Minimum Edge Count are NP-Complete Under Vertex Elimination
por: Bentert, Matthias, et al.
Publicado: (2025)

Correlation Clustering with Vertex Splitting
por: Bentert, Matthias, et al.
Publicado: (2024)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
por: Mizutani, Yosuke, et al.
Publicado: (2024)

A Space-Efficient Algebraic Approach to Robotic Motion Planning
por: Bentert, Matthias, et al.
Publicado: (2024)

Efficient Trace Frequency Queries in Sparse Graphs
por: Awofeso, Christine, et al.
Publicado: (2025)

Overlapping Biclustering
por: Bentert, Matthias, et al.
Publicado: (2025)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
por: Crane, Alex, et al.
Publicado: (2023)

Preprocessing to Reduce the Search Space for Odd Cycle Transversal
por: Jansen, Bart M. P., et al.
Publicado: (2024)

Planar Network Diversion
por: Bentert, Matthias, et al.
Publicado: (2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
por: Crane, Alex, et al.
Publicado: (2025)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

Equalizing Closeness Centralities via Edge Additions
por: Crane, Alex, et al.
Publicado: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
por: Mizutani, Ryuhei
Publicado: (2025)

Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

Parameterized Algorithms for Minimum Sum Vertex Cover
por: Aute, Shubhada, et al.
Publicado: (2024)

The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive
por: Manoussakis, George
Publicado: (2019)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
por: Abbasi, Ali, et al.
Publicado: (2026)

A Simplified Parameterized Algorithm for Directed Feedback Vertex Set
por: Xiong, Ziliang, et al.
Publicado: (2024)

Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
por: Kumar, Mithilesh, et al.
Publicado: (2024)

Exact Algorithms for Distance to Unique Vertex Cover
por: Fioravantes, Foivos, et al.
Publicado: (2025)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
por: Kolmogorov, Vladimir, et al.
Publicado: (2026)

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments
por: Gupta, Sushmita, et al.
Publicado: (2024)

Optimizing Probabilistic Propagation in Graphs by Adding Edges
por: Bhaskara, Aditya, et al.
Publicado: (2024)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
por: Esmer, Barış Can, et al.
Publicado: (2024)

An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
por: Kobayashi, Yusuke, et al.
Publicado: (2026)

Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
por: Bentert, Matthias, et al.
Publicado: (2024)

Simple Sublinear Algorithms for $(Δ+1)$ Vertex Coloring via Asymmetric Palette Sparsification
por: Assadi, Sepehr, et al.
Publicado: (2025)

Discounted Cuts: A Stackelberg Approach to Network Disruption
por: Drange, Pål Grønås, et al.
Publicado: (2025)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
por: Clinch, Katie, et al.
Publicado: (2025)

Succinct Graph Representations and Algorithmic Applications
por: Ullah, Ahammed, et al.
Publicado: (2026)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
por: Chuzhoy, Julia, et al.
Publicado: (2025)

Methodology of Algorithm Engineering
por: Mendling, Jan, et al.
Publicado: (2023)

Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
por: Gaikwad, Ajinkya, et al.
Publicado: (2025)

Semi-Streaming Algorithms for Hypergraph Matching
por: Reinstädtler, Henrik, et al.
Publicado: (2025)

New Algorithms and Hardness Results for Connected Clustering
por: Eube, Jan, et al.
Publicado: (2025)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
por: Jana, Satyabrata, et al.
Publicado: (2025)

Differentially Private Learning of Exponential Distributions: Simple Algorithms and Tight Bounds
por: Mahpud, Bar, et al.
Publicado: (2025)

Enumeration kernels for Vertex Cover and Feedback Vertex Set
por: Bougeret, Marin, et al.
Publicado: (2025)

Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance
por: Song, Zhao, et al.
Publicado: (2022)

Semi-Streaming Algorithms for Weighted $k$-Disjoint Matchings
por: Ferdous, S M, et al.
Publicado: (2023)