Imagen de Portada

The Polymatroid Representation of a Greedoid, and Associated Galois Connections

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Streit, Robert P., Garg, Vijay K.
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Discrete Mathematics Data Structures and Algorithms G.2.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Reducing Matroid Optimization to Basis Search
por: Streit, Robert, et al.
Publicado: (2024)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
por: Shota, Kan, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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)

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

Counting overlapping pairs of words
por: Rivals, Eric, et al.
Publicado: (2024)

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

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

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

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

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
por: Kita, Nanano
Publicado: (2025)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
por: Deligkas, Argyrios, et al.
Publicado: (2025)

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

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

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
por: Ghanbari, Babak, et al.
Publicado: (2025)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
por: Ghanbari, Babak, et al.
Publicado: (2026)

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

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)

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

Sandwich Monotonicity and the Recognition of Weighted Graph Classes
por: Beisegel, Jesse, et al.
Publicado: (2025)

Bounding Width on Graph Classes of Constant Diameter
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

A Uniformly Random Solution to Algorithmic Redistricting
por: Cai, Jin-Yi, et al.
Publicado: (2024)

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

Tight bounds on adjacency labels for monotone graph classes
por: Bonnet, Édouard, et al.
Publicado: (2023)

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
por: Bonnet, Édouard, et al.
Publicado: (2023)

On the complexity of finding a spanning even tree in a graph
por: Hanaka, Tesshu, et al.
Publicado: (2024)

On the number of $k$-mers admitting a given lexicographical minimizer
por: Ingels, Florian, et al.
Publicado: (2024)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
por: Alecu, Bogdan, et al.
Publicado: (2024)

Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
por: Shook, James M., et al.
Publicado: (2025)

Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
por: Avila, Tatiana Rocha, et al.
Publicado: (2026)

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

Towards the Characterization of Terminal Cut Functions: a Condition for Laminar Families
por: Chen, Yu, et al.
Publicado: (2023)

Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
por: Chakrabarty, Deeparnab, et al.
Publicado: (2024)