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.
- Distributed backup placement in networks (Q1741963) (← links)
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs (Q1751210) (← links)
- \(b\)-coloring of tight graphs (Q1759847) (← links)
- Solving Kirkman's schoolgirl problem in a few seconds (Q1774517) (← links)
- The geometry of partial fitness orders and an efficient method for detecting genetic interactions (Q1784416) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- On improving matchings in trees, via bounded-length augmentations (Q1801054) (← links)
- Special parity of perfect matchings in bipartite graphs (Q1812865) (← links)
- Triangulations intersect nicely (Q1816461) (← links)
- Graph-theoretical approach to qualitative solvability of linear systems (Q1839015) (← links)
- Finding all common bases in two matroids (Q1842654) (← links)
- An algorithm for fractional assignment problems (Q1842662) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Efficient and flexible matching of recursive types (Q1854490) (← links)
- On the parametric complexity of schedules to minimize tardy tasks. (Q1874274) (← links)
- Tight bounds on maximal and maximum matchings (Q1877645) (← links)
- Complexity of learning in concept lattices from positive and negative examples (Q1878406) (← links)
- It is tough to be a plumber (Q1885007) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- Isomorphic tree spanner problems (Q1899446) (← links)
- On some algorithmic investigations of star partitions of graphs (Q1900141) (← links)
- Finding a maximum matching in a permutation graph (Q1902306) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- Algorithms for dense graphs and networks on the random access computer (Q1918989) (← links)
- On strongly connected digraphs with bounded cycle length (Q1923587) (← links)
- Improved algorithms for even factors and square-free simple \(b\)-matchings (Q1934309) (← links)
- Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem (Q1947805) (← links)
- On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739) (← links)
- Maximum matching in regular and almost regular graphs (Q1949755) (← links)
- Learning block-preserving graph patterns and its application to data mining (Q1959502) (← links)
- Housing markets through graphs (Q1959727) (← links)
- Optimal transmission schedules for lightwave networks embedded with de Bruijn graphs (Q1960539) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms (Q1996663) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- On the solution bound of two-sided scaffold filling (Q2034400) (← links)
- School choice: Nash implementation of stable matchings through rank-priority mechanisms (Q2051001) (← links)
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593) (← links)
- Output sensitive fault tolerant maximum matching (Q2097219) (← links)
- Measurable equidecompositions for group actions with an expansion property (Q2098198) (← links)
- Computing valuations of the Dieudonné determinants (Q2100059) (← links)
- Feedback control for structured descriptor systems with minimum free-entry pattern gain vectors (Q2103682) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves (Q2117014) (← links)
- A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness (Q2125539) (← links)
- Minimal rationalizations (Q2143882) (← links)
