Pages that link to "Item:Q5682014"
From MaRDI portal
The following pages link to An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (Q5682014):
Displaying 50 items.
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
- Uniform-scale assessment of role minimization in bipartite networks and its application to access control (Q2150958) (← links)
- On graphs whose eternal vertex cover number and vertex cover number coincide (Q2161248) (← links)
- Faster algorithm for finding maximum 1-restricted simple 2-matchings (Q2169943) (← links)
- Chromatic index of dense quasirandom graphs (Q2171027) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- Sorting with forbidden intermediates (Q2181215) (← links)
- On applications of bipartite graph associated with algebraic structures (Q2189215) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities (Q2229485) (← links)
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
- The envy-free matching problem with pairwise preferences (Q2234784) (← links)
- The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
- Decomposition of university course timetabling. A systematic study of subproblems and their complexities (Q2241151) (← links)
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics (Q2248525) (← links)
- Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound (Q2251365) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- On the complexity of connectivity in cognitive radio networks through spectrum assignment (Q2253963) (← links)
- An approximation of the minimum vertex cover in a graph (Q2258357) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Block-based minimum input design for the structural controllability of complex networks (Q2280810) (← links)
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph (Q2286744) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- A faster algorithm for cuckoo insertion and bipartite matching in large graphs (Q2319642) (← links)
- Recomputing causality assignments on lumped process models when adding new simplification assumptions (Q2331813) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)
- Approximability of minimum certificate dispersal with tree structures (Q2354400) (← links)
- Choosing \(k\) from \(m\): feasible elimination procedures reconsidered (Q2357822) (← links)
- Approximation algorithms for Max Morse matching (Q2362103) (← links)
- Finding a complete matching with the maximum product on weighted bipartite graphs (Q2365954) (← links)
- Distributed scheduling for disconnected cooperation (Q2375304) (← links)
- A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
- Generalised arc consistency for the AllDifferent constraint: an empirical survey (Q2389692) (← links)
- A fixed-parameter tractable algorithm for matrix domination (Q2390264) (← links)
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (Q2390325) (← links)
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)
- Finding minimum clique capacity (Q2392036) (← links)
- Allowing cycles in discrete Morse theory (Q2401549) (← links)
- On the fixed controllable subspace in linear structured systems (Q2407901) (← links)
- New characterisations of tree-based networks and proximity measures (Q2411310) (← links)
- Recovery of disrupted airline operations using \(k\)-maximum matching in graphs (Q2413142) (← links)
- Probabilistic quality estimations for combinatorial optimization problems (Q2413265) (← links)
- Maximum matching width: new characterizations and a fast algorithm for dominating set (Q2413973) (← links)
- Edge-stable equimatchable graphs (Q2414461) (← links)
- The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs (Q2420642) (← links)
