Keywords: Transportation problem; Greedy algorithm; Duality; Supermodularity; Matroid;
مقالات ISI ترجمه شده
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: matroid; amalgam; embedding; projective space;
Keywords: matroid; edge-cover; edge covering number; fair representation;
Keywords: Buyback problem; Discrete concave function; Gross substitutes valuation; Online discrete optimization problem; Matroid;
Keywords: Antidirected path; Bipartite representation; Matroid; Detachment; Anticonnected digraph;
Keywords: Integer programming; Combinatorial optimization; Unimodular; Matroid; Spanning tree; Matching;
Keywords: Bounded degree spanning tree; Approximation algorithm; Matroid;
Keywords: Congestion game; Approximation algorithm; Polymatroid; Matroid;
Keywords: Online algorithms; Competitive analysis; Verification; Minimum multi-cut; Matroid
Keywords: Rough set; Covering; Approximation; Geometric lattice; Matroid;
Keywords: primary, 05A19; secondary, 52C05, 05A15, 05B35, 05E05Lattice path; Combinatorial statistic; Bijection; Triangulation; Semistandard Young tableau; Flagged tableau; Tutte polynomial; Matroid
Keywords: Rough set; Covering; Approximation number function; Matroid
Keywords: Greedy algorithm; Matroid; Poset; Abstract simplicial complex;
Keywords: Rough set; Matroid; Nullity; Matrix; Attribute reduction
Keywords: Parking functions; Symmetric group; Dyck paths; Representation; Matroid
Keywords: 52B; 52C; 62H; 68Q; 68R; 90B; 90CCombinatorial optimization; Matroid; Projection; Integer programming; Transportation problem; Statistical table
Keywords: Hydrocarbon; Undirected graph; Matching; Delta-matroid; Matroid; Group action; Classification;
Keywords: Matroid; Discriminant; Hyperplane arrangement; Ramification locus; Fully real system;
Keywords: Packing; Matroid; Tree; Rigidity; Orientation
Vectors of matroids over tracts
Keywords: Matroid; Oriented matroid; Tract; Hyperfield; Covector;
Some heterochromatic theorems for matroids
Keywords: Anti-Ramsey number; Hypergraph; Matroid;
Old and new results on packing arborescences in directed hypergraphs
Keywords: Arborescence; Packing; Directed hypergraph; Matroid;
An excluded minors method for infinite matroids
Keywords: Matroid; Infinite Matroid; Tree-decomposition; Representable; Rota's Conjecture; Minor; Tutte-decomposition; Thin sums; Ends;
Computing DM-decomposition of a partitioned matrix with rank-1 blocks
Keywords: 15A21; 15B99; 68Q25; Dulmage-Mendelsohn decomposition; Partitioned matrix; Submodular function; Modular lattice; Matroid;
Non-representable hyperbolic matroids
Keywords: Hyperbolic polynomial; Generalized Lax conjecture; Matroid; Hyperbolic matroid;
Orienting transversals and transition polynomials of multimatroids
Keywords: 05B35; Multimatroid; Isotropic system; Transition polynomial; Tutte polynomial; Interlace polynomial; Matroid; 4-Regular graph;
On Finding Some New Excluded Minors for Gammoids
Keywords: matroid; gammoids; cyclic flats;
On packing spanning arborescences with matroid constraint
Keywords: connectivity; packing arborescences; Edmonds' branching theorem; matroid;
On graphs uniquely defined by their K-circular matroids
Keywords: Graph; Vertex star; Bicycle; Cacti-graph; Matroid; k-circular matroid; Non-separating cocircuit;
The structure of matroids with a spanning clique or projective geometry
Keywords: Matroid;
k-circular matroids of graphs
Keywords: Graph; Bicycle; Cacti-graph; Splitter theorems; Matroid; k-circular matroid;
Transformation and decomposition of clutters into matroids
Keywords: 05B35; 05C65; Clutter; Matroid; Decomposition; Poset;
Algorithm for constraint partial inverse matroid problem with weight increase forbidden
Keywords: Partial inverse optimization problem; Matroid; Weight constraint; Polynomial time algorithm
The number of elements belonging to triads in 3-connected binary matroids
Keywords: Matroid; 3-connected; Binary; Triangle; Triad;
Certifying non-representability of matroids over prime fields
Keywords: Matroid; Representable; Prime field
A generalization of weight polynomials to matroids
Keywords: Matroid; Weight enumerator; Linear code; Stanley–Reisner ideal; Higher weights; Tutte polynomial
The structure of 2-separations of infinite matroids
Keywords: Infinite; Matroid; Tree-decomposition; Tutte; Cunningham; Edmonds; Seymour; 2-separation; 3-connected
Zonotopal algebra and forward exchange matroids
Keywords: primary, 05A15, 05B35, 13B25, 16S32, 41A15; secondary, 05C31, 41A63, 47F05Zonotopal algebra; Matroid; Tutte polynomial; Hyperplane arrangement; Multivariate spline; Graded vector space; Kernel of differential operators; Hilbert series
The Kazhdan-Lusztig polynomial of a matroid
Keywords: Matroid; Orlik-Terao algebra; Intersection cohomology; Kazhdan-Lusztig theory;
Projective geometries in exponentially dense matroids. II
Keywords: Matroid; Minor;
Approximate tradeoffs on weighted labeled matroids
Keywords: Matroid; Bi-objective; Additive weight; Weighted labeled; Approximate solution
Completion and decomposition of a clutter into representable matroids
Keywords: 05B35; 05C65; Clutter; Hypergraph; Matroid; Decomposition; Representable matroid;
Counting matroids in minor-closed classes
Keywords: Matroid; Excluded minor; Asymptotic enumeration; Algorithmic complexity
Projective geometries in exponentially dense matroids. I
Keywords: Matroid; Minor
Bicircular signed-graphic matroids
Keywords: Matroid; Bicircular; Signed-graphic; Transversal; Series–parallel
The number of rank-k flats in a matroid with no U2,n-minor
Keywords: Matroid; Whitney numbers;
Graph and matrix approaches to rough sets through matroids
Keywords: Rough set; Matroid; Representable matroid; Graphic matroid; Matrix
On the toric ideal of a matroid
Keywords: Matroid; Toric ideal; Base exchange; Strongly base orderable matroid
On the Gorensteinness of broken circuit complexes and Orlik-Terao ideals
Keywords: Broken circuit complex; Complete intersection; Gorenstein; Hyperplane arrangement; Matroid; Orlik-Terao algebra;
The Buneman index via polyhedral split decomposition
Keywords: 05B35; 52C35Buneman index; Vector configuration; Hyperplane arrangement; Geometric lattice; Matroid