The following pages link to (Q3928230):
Displaying 39 items.
- On \(b\)-bistochastic quadratic stochastic operators (Q264972) (← links)
- Zonotopal algebra and forward exchange matroids (Q266145) (← links)
- Local maximum stable set greedoids stemming from very well-covered graphs (Q444454) (← links)
- Greedy algorithms and poset matroids (Q473210) (← links)
- On local maximum stable set greedoids (Q658102) (← links)
- Exact localisations of feedback sets (Q722200) (← links)
- Matroids and antimatroids - a survey (Q757382) (← links)
- Categories of \((I, I)\)-fuzzy greedoids (Q898215) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Graph operations that are good for greedoids (Q987691) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- A note on selectors and greedoids (Q1061744) (← links)
- Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes (Q1069309) (← links)
- Non-interval greedoids and the transposition property (Q1079572) (← links)
- Linear objective functions on certain classes of greedoids (Q1082346) (← links)
- Homotopy properties of greedoids (Q1101115) (← links)
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (Q1102299) (← links)
- A characterization of undirected branching greedoids (Q1103626) (← links)
- Pseudomatroids (Q1109779) (← links)
- A circuit set characterization of antimatroids (Q1112050) (← links)
- Greedoids and searches in directed graphs (Q1182876) (← links)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- On Brylawski's generalized duality (Q1949045) (← links)
- Factorisation of greedoid polynomials of rooted digraphs (Q2053691) (← links)
- Sufficient conditions for the optimality of the greedy algorithm in greedoids (Q2168727) (← links)
- Coordinatization of finite join-distributive lattices. (Q2249406) (← links)
- Polymatroid greedoids (Q2266020) (← links)
- Linear relations for a generalized Tutte polynomial (Q2341072) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- An algorithmic characterization of antimatroids (Q2640448) (← links)
- Greedoids and Linear Objective Functions (Q3323971) (← links)
- On the subdifferential of a submodular function (Q3332786) (← links)
- Fixpoints and Search in PVS (Q3558967) (← links)
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties (Q4631095) (← links)
- On stable <i>b</i>-bistochastic quadratic stochastic operators and associated non-homogenous Markov chains (Q4640049) (← links)
- Root polytopes and Jaeger‐type dissections for directed graphs (Q6074977) (← links)
- Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid (Q6135742) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
- A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids (Q6543051) (← links)
