Pages that link to "Item:Q751274"

The following pages link to Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (Q751274):

Displayed 28 items.

• Parameterized complexity of \(k\)-anonymity: hardness and tractability (Q358665) ‎ (← links)
• Finding all maximally-matchable edges in a bipartite graph (Q418005) ‎ (← links)
• The balanced traveling salesman problem (Q614063) ‎ (← links)
• Trapezoid graphs and generalizations, geometry and algorithms (Q678864) ‎ (← links)
• An O(\(n\)) time algorithm for maximum matching on cographs (Q685476) ‎ (← links)
• Selected topics on assignment problems (Q697571) ‎ (← links)
• Parallel algorithms for bipartite matching problems on distributed memory computers (Q712711) ‎ (← links)
• Perfect matchings and extended polymatroid (Q946789) ‎ (← links)
• On complexity of special maximum matchings constructing (Q952636) ‎ (← links)
• Minimum leaf out-branching and related problems (Q1035689) ‎ (← links)
• A linear time algorithm for the maximum matching problem on cographs (Q1314631) ‎ (← links)
• Persistency in maximum cardinality bipartite matchings (Q1332944) ‎ (← links)
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (Q1337676) ‎ (← links)
• Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280) ‎ (← links)
• Multiple bottleneck assignment problem (Q1806893) ‎ (← links)
• Weakly Hamiltonian-connected ordinary multipartite tournaments (Q1842145) ‎ (← links)
• Alternating paths in edge-colored complete graphs (Q1842658) ‎ (← links)
• Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) ‎ (← links)
• Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs (Q1894766) ‎ (← links)
• Algorithms for dense graphs and networks on the random access computer (Q1918989) ‎ (← links)
• Generalised arc consistency for the AllDifferent constraint: an empirical survey (Q2389692) ‎ (← links)
• Sweep synchronization as a global propagation mechanism (Q2489125) ‎ (← links)
• On uniform \(k\)-partition problems (Q2565854) ‎ (← links)
• OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS (Q3130156) ‎ (← links)
• Minimum Leaf Out-Branching Problems (Q3511432) ‎ (← links)
• Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) ‎ (← links)
• Perfectly matchable subgraph problem on a bipartite graph (Q5189879) ‎ (← links)
• A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) ‎ (← links)