The following pages link to Matching theory (Q3395507):
Displaying 50 items.
- Cubic graphs that cannot be covered with four perfect matchings (Q2040017) (← links)
- Laminar tight cuts in matching covered graphs (Q2040018) (← links)
- Sharp bounds on the permanental sum of a graph (Q2053704) (← links)
- A faster parameterized algorithm for temporal matching (Q2059876) (← links)
- Matchings and squarefree powers of edge ideals (Q2077270) (← links)
- Graft analogue of general Kotzig-Lovász decomposition (Q2081503) (← links)
- Atoms of the matching measure (Q2082687) (← links)
- Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
- Matching theory and Barnette's conjecture (Q2099486) (← links)
- The matching process and independent process in random regular graphs and hypergraphs (Q2111785) (← links)
- A refined Gallai-Edmonds structure theorem for weighted matching polynomials (Q2111908) (← links)
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes (Q2121466) (← links)
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
- On the quadratic random matching problem in two-dimensional domains (Q2136099) (← links)
- Further results on the star degree of graphs (Q2139789) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- On relations between transportation cost spaces and \(\ell_1\) (Q2207636) (← links)
- Fair-by-design matching (Q2212506) (← links)
- A remark on approximating permanents of positive definite matrices (Q2226442) (← links)
- Null decomposition of bipartite graphs without cycles of length 0 modulo 4 (Q2229480) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Image representation using Laplacian regularized nonnegative tensor factorization (Q2275997) (← links)
- Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity (Q2289006) (← links)
- Multi-manifold matrix decomposition for data co-clustering (Q2290340) (← links)
- Cooperative colorings of trees and of bipartite graphs (Q2294110) (← links)
- Quadratic vertex kernel for rainbow matching (Q2300725) (← links)
- On width measures and topological problems on semi-complete digraphs (Q2312615) (← links)
- Reward maximization in general dynamic matching systems (Q2326234) (← links)
- Tractability of König edge deletion problems (Q2333799) (← links)
- Unavoidable minors for connected 2-polymatroids (Q2338642) (← links)
- Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection (Q2416964) (← links)
- Fractional perfect \(b\)-matching polytopes. I: General theory (Q2435578) (← links)
- Chip removal for computing the number of perfect matchings (Q2628953) (← links)
- Towards a better integration of modelers and black box constraint solvers within the product design process (Q2631961) (← links)
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching (Q2654962) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
- Short coverings and matching in weighted graphs (Q2840730) (← links)
- Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation (Q2867138) (← links)
- Constant Factor Approximation for the Weighted Partial Degree Bounded Edge Packing Problem (Q2958313) (← links)
- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion (Q3058695) (← links)
- Statistical Matching Theory (Q3295266) (← links)
- Sequential Importance Sampling for Estimating the Number of Perfect Matchings in Bipartite Graphs: An Ongoing Conversation with Laci (Q3295267) (← links)
- Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization (Q3295273) (← links)
- Topological transition in disordered planar matching: combinatorial arcs expansion (Q3301828) (← links)
- Coalescing Walks on Rotor-Router Systems (Q3460734) (← links)
- A deterministic PTAS for the commutative rank of matrix spaces (Q4568108) (← links)
- The isolated-pentagon rule and nice substructures in fullerenes (Q4629560) (← links)
- Approximating permanents and hafnians (Q4645007) (← links)
- Short covering codes arising from matchings in weighted graphs (Q4911918) (← links)
