Pages that link to "Item:Q1145508"
From MaRDI portal
The following pages link to Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems (Q1145508):
Displayed 30 items.
- Dynamic matchings in left vertex weighted convex bipartite graphs (Q328682) (← links)
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- An 0(n log n) algorithm for the convex bipartite matching problem (Q792885) (← links)
- Probabilistic single processor scheduling (Q912611) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- Counting preimages of TCP reordering patterns (Q1003463) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- A linear-time algorithm for a special case of disjoint set union (Q1062461) (← links)
- On-line updating of solutions to a class of matroid intersection problems (Q1090461) (← links)
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298) (← links)
- Parallel maximum independent set in convex bipartite graphs (Q1350905) (← links)
- The maximum deviation just-in-time scheduling problem. (Q1421459) (← links)
- Biconvex graphs: Ordering and algorithms (Q1570816) (← links)
- Counting independent sets and maximal independent sets in some subclasses of bipartite graphs (Q1627864) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260) (← links)
- Optimal computation of shortest paths on doubly convex bipartite graphs (Q1963107) (← links)
- Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- Finding a manhattan path and related problems (Q3313268) (← links)
- Variants of Multi-resource Scheduling Problems with Equal Processing Times (Q3467836) (← links)
- AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER (Q4820064) (← links)
- AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER∗ (Q4820104) (← links)
- On the complexity of the maximum biplanar subgraph problem (Q5946290) (← links)
