Pages that link to "Item:Q4302856"

The following pages link to Faster scaling algorithms for general graph matching problems (Q4302856):

Displaying 50 items.

• Strong cliques and equistability of EPT graphs (Q260014) (← links)
• Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
• Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
• On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
• An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
• Approximate shortest paths in weighted graphs (Q414929) (← links)
• A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657) (← links)
• A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
• A model for minimizing active processor time (Q487001) (← links)
• Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
• Approximating the metric TSP in linear time (Q649110) (← links)
• An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
• Cluster editing with locally bounded modifications (Q713321) (← links)
• Approximating edge dominating set in dense graphs (Q764308) (← links)
• Improved algorithm for the symmetry number problem on trees (Q844174) (← links)
• Improved bounds for vehicle routing solutions (Q865747) (← links)
• Incremental assignment problem (Q865928) (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• A simple approximation algorithm for the weighted matching problem (Q1007528) (← links)
• Edges and switches, tunnels and bridges (Q1028235) (← links)
• Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
• A fast scaling algorithm for the weighted triangle-free 2-matching problem (Q1678085) (← links)
• A genetic-based framework for solving (multi-criteria) weighted matching problems. (Q1811148) (← links)
• Approximate minimum weight matching on points in k-dimensional space (Q1825658) (← links)
• Adaptive paired comparison design (Q1888844) (← links)
• Maximum matching in regular and almost regular graphs (Q1949755) (← links)
• Output sensitive fault tolerant maximum matching (Q2097219) (← links)
• Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
• Two dimensional maximum weight matching using Manhattan topology (Q2157895) (← links)
• The power of linear-time data reduction for maximum matching (Q2211355) (← links)
• Approximating the smallest 2-vertex connected spanning subgraph of a directed graph (Q2286744) (← links)
• Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
• Recomputing causality assignments on lumped process models when adding new simplification assumptions (Q2331813) (← links)
• Paths and trails in edge-colored weighted graphs (Q2333812) (← links)
• Maximum matchings in planar graphs via Gaussian elimination (Q2369872) (← links)
• Paths and trails in edge-colored graphs (Q2378531) (← links)
• Algorithms for solving the symmetry number problem on trees (Q2390304) (← links)
• A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (Q2390325) (← links)
• A 4/3-approximation for TSP on cubic 3-edge-connected graphs (Q2417175) (← links)
• Bayesian locally optimal design of knockout tournaments (Q2427164) (← links)
• Almost exact matchings (Q2429356) (← links)
• Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
• Pareto optimality in coalition formation (Q2437839) (← links)
• Fork-forests in bi-colored complete bipartite graphs (Q2446314) (← links)
• Equistable simplicial, very well-covered, and line graphs (Q2448905) (← links)
• Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
• Processor efficient parallel matching (Q2471700) (← links)
• An extension of Hall's theorem for partitioned bipartite graphs (Q2630339) (← links)
• Efficient Matching for Column Intersection Graphs (Q2828179) (← links)
• Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)