Imagen de Portada

Transversal Rank, Conformality and Enumeration

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Schirneck, Martin
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

Simpler and Improved Replacement Path Coverings
por: Bilò, Davide, et al.
Publicado: (2026)

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
por: Bilò, Davide, et al.
Publicado: (2024)

Fault-Tolerant ST-Diameter Oracles
por: Bilò, Davide, et al.
Publicado: (2023)

Improved Distance (Sensitivity) Oracles with Subquadratic Space
por: Bilò, Davide, et al.
Publicado: (2024)

Approximate Distance Sensitivity Oracles in Subquadratic Space
por: Bilò, Davide, et al.
Publicado: (2023)

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
por: Gomes, Guilherme C. M., et al.
Publicado: (2024)

Enumerating All Directed Spanning Trees in Optimal Time
por: Gawrychowski, Paweł, et al.
Publicado: (2026)

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

Enumerating m-Length Walks in Directed Graphs with Constant Delay
por: Adamson, Duncan, et al.
Publicado: (2024)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
por: Cai, Xinwei, et al.
Publicado: (2023)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
por: Conte, Alessio, et al.
Publicado: (2024)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
por: Kobayashi, Yasuaki, et al.
Publicado: (2023)

Ranked Enumeration for MSO on Trees via Knowledge Compilation
por: Amarilli, Antoine, et al.
Publicado: (2023)

Enumeration Algorithms for Conjunctive Queries with Projection
por: Deep, Shaleen, et al.
Publicado: (2021)

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

Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering
por: Adriaens, Florian, et al.
Publicado: (2026)

Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
por: Nozaki, Yuta, et al.
Publicado: (2024)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
por: Kenig, Batya, et al.
Publicado: (2024)

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
por: Kobayashi, Yasuaki, et al.
Publicado: (2020)

An Enumerative Perspective on Connectivity
por: Akmal, Shyan
Publicado: (2023)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
por: Kurita, Kazuhiro, et al.
Publicado: (2022)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
por: Bringmann, Karl, et al.
Publicado: (2026)

QuadRank: Engineering a High Throughput Rank
por: Koerkamp, R. Groot
Publicado: (2026)

Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
por: Bringmann, Karl, et al.
Publicado: (2022)

Enumerating all minimal hitting sets in polynomial total time
por: Wild, Marcel
Publicado: (2023)

Local Enumeration: The Not-All-Equal Case
por: Gurumukhani, Mohit, et al.
Publicado: (2025)

The Complexity of Maximal Common Subsequence Enumeration
por: Buzzega, Giovanni, et al.
Publicado: (2025)

Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space
por: Jang, Jihoon, et al.
Publicado: (2025)

Dynamic Rank, Basis, and Matching
por: Brand, Jan van den, et al.
Publicado: (2026)

Consistent Low-Rank Approximation
por: Woodruff, David P., et al.
Publicado: (2026)

Efficient Dynamic Rank Aggregation
por: Alimi, Morteza, et al.
Publicado: (2025)

Optimal Enumeration of Eulerian Trails in Directed Graphs
por: Bals, Ben, et al.
Publicado: (2026)

Efficient Enumeration of At Most $k$-Out Polygons
por: Akram, Waseem, et al.
Publicado: (2025)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
por: Kobayashi, Yasuaki, et al.
Publicado: (2023)

Instance-Optimality in PageRank Computation
por: Thorup, Mikkel, et al.
Publicado: (2025)

Improved Approximation for Ranking on General Graphs
por: Derakhshan, Mahsa, et al.
Publicado: (2025)

On Rotation Distance of Rank Bounded Trees
por: M., Anoop S. K., et al.
Publicado: (2023)

Learning Partitions using Rank Queries
por: Chakrabarty, Deeparnab, et al.
Publicado: (2024)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
por: Kurita, Kazuhiro, et al.
Publicado: (2025)

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences
por: Mihalák, Matúš, et al.
Publicado: (2015)