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.
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Parallel algorithms for bipartite matching problems on distributed memory computers (Q712711) (← links)
- A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem (Q719294) (← links)
- Cliques in hyperbolic random graphs (Q724237) (← links)
- Enhancing multi-document summarization using concepts (Q724670) (← links)
- Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (Q751274) (← links)
- Making sparse matrices sparser: Computational results (Q751503) (← links)
- A simple existence criterion for \((g<f)\)-factors (Q757439) (← links)
- A perfect matching algorithm for sparse bipartite graphs (Q759771) (← links)
- Balanced optimization problems (Q760338) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Embedding partial Steiner triple systems is NP-complete (Q787671) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Jump number of dags having Dilworth number 2 (Q791537) (← links)
- The complexity of completing partial Latin squares (Q793029) (← links)
- Signsolvability revisited (Q795898) (← links)
- Deadlock-freedom in resource contentions (Q801672) (← links)
- On the computational complexity of qualitative coalitional games (Q814613) (← links)
- An efficient bounds consistency algorithm for the global cardinality constraint (Q816677) (← links)
- Looking at the stars (Q820158) (← links)
- Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551) (← links)
- A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem (Q831124) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- Quantum algorithms for matching problems (Q839634) (← links)
- An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs (Q845858) (← links)
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time (Q847661) (← links)
- Structural identifiability in low-rank matrix factorization (Q848955) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- Multiconsistency and robustness with global constraints (Q857890) (← links)
- On size reduction techniques for multitape automata (Q860868) (← links)
- Incremental assignment problem (Q865928) (← links)
- Alternating paths along axis-parallel segments (Q882782) (← links)
- The single-input minimal controllability problem for structured systems (Q893991) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- Structural control of single-input rank one bilinear systems (Q899250) (← links)
- Bottleneck partial-matching Voronoi diagrams and applications (Q902422) (← links)
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283) (← links)
- An efficient distributed algorithm for maximum matching in general graphs (Q911306) (← links)
- Efficient simulation of circuits by EREW PRAMs (Q911771) (← links)
- A theory of rectangular dual graphs (Q923112) (← links)
- Solving linear programs from sign patterns (Q927161) (← links)
- Solving the car sequencing problem via branch \& bound (Q932220) (← links)
- Authentication codes and bipartite graphs (Q932829) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
