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.
- A remark on the time complexity of the subtree problem (Q1249180) (← links)
- Representing triangulated graphs in stars (Q1261172) (← links)
- Approximating matchings in parallel (Q1261482) (← links)
- On the use of the complexity index as a measure of complexity in activity networks (Q1278225) (← links)
- Approximating the permanent via importance sampling with application to the dimer covering problem (Q1282386) (← links)
- A linear algorithm for perfect matching in hexagonal systems (Q1313858) (← links)
- Network flow and 2-satisfiability (Q1317481) (← links)
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm (Q1323480) (← links)
- Finding all the perfect matchings in bipartite graphs (Q1324433) (← links)
- A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing (Q1327210) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Maximizing the number of unused colors in the vertex coloring problem (Q1336741) (← links)
- Finding maximum matching for bipartite graphs in parallel (Q1342094) (← links)
- Clique covering and clique partition in generalizations of line graphs (Q1343162) (← links)
- Tiling figures of the plane with two bars (Q1346250) (← links)
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298) (← links)
- A polynomial-time algorithm for reducing the number of variables in MAX SAT problem (Q1367267) (← links)
- Solution methods and computational investigations for the linear bottleneck assignment problem (Q1377280) (← links)
- Activity nets: A guided tour through some recent developments (Q1388902) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- Triangulating multitolerance graphs (Q1392575) (← links)
- Scalar aggregation in inconsistent databases. (Q1401279) (← links)
- Small maximal matchings in random graphs. (Q1401316) (← links)
- Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems (Q1406022) (← links)
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
- Computing Euclidean bottleneck matchings in higher dimensions (Q1607062) (← links)
- Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
- Matchings in colored bipartite networks (Q1613406) (← links)
- Orthogonal layout with optimal face complexity (Q1616241) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Optimizing the controllability of arbitrary networks with genetic algorithm (Q1619203) (← links)
- Characterizing the topological and controllability features of U.S. power transmission networks (Q1619487) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- The stochastic stability of decentralized matching on a graph (Q1651273) (← links)
- Efficient subgraph matching using topological node feature constraints (Q1677053) (← links)
- A fast scaling algorithm for the weighted triangle-free 2-matching problem (Q1678085) (← links)
- Gross substitutability: an algorithmic survey (Q1682734) (← links)
- Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069) (← links)
- Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
- Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
- Network alignment by discrete Ollivier-Ricci flow (Q1725779) (← links)
- Algorithms and bounds for drawing directed graphs (Q1725793) (← links)
- A marriage matching mechanism menagerie (Q1727951) (← links)
- Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- Parameterized algorithms and kernels for rainbow matching (Q1739114) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)