Results 1 to 10 of about 27 (27)

The Elser nuclei sum revisited [PDF]

Discrete Mathematics & Theoretical Computer Science, 2021
Fix a finite undirected graph $\Gamma$ and a vertex $v$ of $\Gamma$. Let $E$ be the set of edges of $\Gamma$. We call a subset $F$ of $E$ pandemic if each edge of $\Gamma$ has at least one endpoint that can be connected to $v$ by an $F$-path (i.e., a ...
Darij Grinberg
doaj   +1 more source

The Sorting Order on a Coxeter Group [PDF]

Discrete Mathematics & Theoretical Computer Science, 2008
Let $(W,S)$ be an arbitrary Coxeter system. For each sequence $\omega =(\omega_1,\omega_2,\ldots) \in S^{\ast}$ in the generators we define a partial order― called the $\omega \mathsf{-sorting order}$ ―on the set of group elements $W_{\omega} \subseteq W$
Drew Armstrong
doaj   +1 more source

On the shelling antimatroids of split graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2017
Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal, Jean-Paul Doignon, Keno Merckx   +2 more
doaj   +1 more source

Upright-Quad Drawing of st-Planar Learning Spaces

Journal of Graph Algorithms and Applications, 2008
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students.
David Eppstein
doaj   +1 more source

Finding a Maximum-Weight Convex Set in a Chordal Graph

Journal of Graph Algorithms and Applications, 2019
We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of all chordless
Jean Cardinal, Jean-Paul Doignon, Keno Merckx   +2 more
doaj   +1 more source

Greedoids and Violator Spaces

Axioms
This research explores the interplay between violator spaces and greedoids—two distinct theoretical frameworks developed independently. Violator spaces were introduced as a generalization of linear programming, while greedoids were designed to ...
Yulia Kempner, Vadim E. Levit
doaj   +1 more source

On cycle-free accessible union stable network structures. [PDF]

4OR
Algaba E, van den Brink R, Dietz C.
europepmc   +1 more source

Two Flags in a Semimodular Lattice Generate an Antimatroid

Order, 2023
Hiroshi Hirai, Koyo Hayashi
exaly  

A Convex Polytope and an Antimatroid for any Given, Finite Group

Electronic Notes in Discrete Mathematics, 2016
Jean-Paul Doignon
exaly  

Jordan Surfaces in Discrete Antimatroid Topologies

Lecture Notes in Computer Science, 2004
Ralph Kopperman
exaly