Pages that link to "Item:Q1145707"
From MaRDI portal
The following pages link to A matching problem with side conditions (Q1145707):
Displaying 35 items.
- Triangle-free 2-matchings and M-concave functions on jump systems (Q401132) (← links)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657) (← links)
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
- An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs (Q448969) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem (Q790834) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422) (← links)
- Weighted restricted 2-matching (Q1013978) (← links)
- Approximating the maximum 3-edge-colorable subgraph problem (Q1043590) (← links)
- Minimal 2-matching-covered graphs (Q1043944) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- A greedy heuristic for a minimum-weight forest problem (Q1317004) (← links)
- A fast scaling algorithm for the weighted triangle-free 2-matching problem (Q1678085) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs (Q1949271) (← links)
- A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges (Q2032181) (← links)
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles (Q2118149) (← links)
- Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
- Matchings of cycles and paths in directed graphs (Q2460633) (← links)
- Finding maximum square-free 2-matchings in bipartite graphs (Q2498740) (← links)
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs (Q3503840) (← links)
- Packings by Complete Bipartite Graphs (Q3728943) (← links)
- Path factors of bipartite graphs (Q4284102) (← links)
- Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles (Q5041752) (← links)
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)
- Approximation Algorithms for a Network Design Problem (Q5323067) (← links)
- Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth (Q5326798) (← links)
- (Q5708503) (← links)
- Finding triangle-free 2-factors in general graphs (Q6540256) (← links)
- Easy and hard separation of sparse and dense odd-set constraints in matching (Q6670496) (← links)