Greedy algorithm and symmetric matroids
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Unimodularity and circle graphs
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- b-matching degree-sequence polyhedra
- Tutte-Martin polynomials and orienting vectors of isotropic systems
- Delta matroids whose fundamental graphs are bipartite
- \(\Delta\)-matroids and metroids
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids
- Symplectic matroids
- \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
- A unified treatment of the geometric algebra of matroids and even \(\Delta\)-matroids
- Coxeter matroid polytopes
- An adjacency criterion for Coxeter matroids
- Multimatroids. IV: Chain-group representations
- \(\Delta\)-matroids with the strong exchange conditions
- A generalization of Tutte's characterization of totally unimodular matrices
- Note on exchange axioms for valuated matroids and valuated delta-matroids
- The delta-sum of matching delta-matroids
- Nonintersecting paths, Pfaffians, and -matroids
- The linear delta-matroid parity problem
- The greedy algorithm and Coxeter matroids
- Combinatorial flag varieties
- Anti-matroids
- A framework for the greedy algorithm
- Universal Tutte characters via combinatorial coalgebras
- Sorting by reversals and the theory of 4-regular graphs
- How many delta-matroids are there?
- The structure of delta-matroids with width one twists
- Polynomial combinatorial algorithms for skew-bisubmodular function minimization
- Matroidal frameworks for topological Tutte polynomials
- Lagrangian subspaces, delta-matroids, and four-term relations
- Pfaffian forms and \(\Delta\)-matroids
- A disturbed version of the greedy algorithm
- A circuit axiomatisation of Lagrangian matroids
- On structures of bisubmodular polyhedra
- Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries
- Circuit separation for symmetric matroids
- Pfaffian forms and \(\Delta\)-matroids with coefficients
- A characterization of bisubmodular functions
- On pseudomatroid property of matrices
- Cuboids, a class of clutters
- The excluded 3-minors for vf-safe delta-matroids
- Delta-matroids as subsystems of sequences of Higgs lifts
- A 2-isomorphism theorem for delta-matroids
- Characterizing matroids whose bases form graphic delta-matroids
- The Tutte polynomial via lattice point counting
- Eulerian and bipartite binary delta-matroids
- Irreducibility of the Tutte polynomial of an embedded graph
- A characterization of circle graphs in terms of total unimodularity
- A note on M-convex functions on jump systems
- The salesman's improved tours for fundamental classes
- Matroids, delta-matroids and embedded graphs
- Generalized skew bisubmodularity: a characterization and a min-max theorem
- Bisubmodular polyhedra, simplicial divisions, and discrete convexity
- Parametric bisubmodular function minimization and its associated signed ring family
- Inductive tools for connected delta-matroids and multimatroids
- Isotropic matroids. III: Connectivity
- Rank-width: algorithmic and structural results
- Interlacement and activities in delta-matroids
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
- Polynomials with the half-plane property and matroid theory
- Even factors, jump systems, and discrete convexity
- Graph polynomials derived from Tutte-Martin polynomials
- Maps and -matroids
- The class of delta-matroids closed under handle slides
- A polyhedral approach to bisubmodular function minimization
- Twist polynomials of delta-matroids
- Optimal matching forests and valuated delta-matroids
- Handle slides for delta-matroids
- Excluding a bipartite circle graph from line graphs
- Circle graph obstructions under pivoting
- Generalized roof duality and bisubmodular functions
- Discrete Decision Process Model Involves Greedy Algorithm over Greedoid
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- Well-quasi-ordering of matrices under Schur complement and applications to directed graphs
- Binary matroids and local complementation
- The Orthant Non-Interaction Theorem for Certain Combinatorial Polyhedra and its Implications in the Intersection and the Dilworth Truncation of Bisubmodular Functions
- The transition matroid of a 4-regular graph: an introduction
- Matroids that classify forests
- Coverings and delta-coverings
- Maps and Δ-matroids revisited
- Orthogonal matroids
- Oriented Lagrangian orthogonal matroid representations
- Multimatroids. III: Tightness and fundamental graphs
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
- Unified Greedy Approximability beyond Submodular Maximization
- Flag matroids with coefficients
- Initial degenerations of spinor varieties
- Amalgamation of real zero polynomials
- Blowup polynomials and delta-matroids of graphs
- Unified greedy approximability beyond submodular maximization
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
- Partial-twuality polynomials of delta-matroids
- First-order logic axiomatization of metric graph theory
- Characterizations of the set of integer points in an integral bisubmodular polyhedron
- Delta-matroids whose twist polynomials are monomials
- Signed permutohedra, delta‐matroids, and beyond
- Isotropical linear spaces and valuated Delta-matroids
- Vertex-minors of graphs: a survey
- A few words about maps
This page was built for publication: Greedy algorithm and symmetric matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3772000)
