Pages that link to "Item:Q873646"
From MaRDI portal
The following pages link to Edge-coloring bipartite multigraphs in \(O(E \log D)\) time (Q873646):
Displaying 43 items.
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
- Subset matching and edge coloring in bipartite graphs (Q510962) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- Colorful strips (Q659707) (← links)
- Compact scheduling of zero-one time operations in multi-stage systems (Q705502) (← links)
- Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph (Q764406) (← links)
- Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks (Q841605) (← links)
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- A simple algorithm for edge-coloring bipartite multigraphs (Q1007547) (← links)
- Space-efficient Euler partition and bipartite edge coloring (Q1628587) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- Chromatic scheduling in a cyclic open shop (Q1767677) (← links)
- A simple matching algorithm for regular bipartite graphs. (Q1853135) (← links)
- Tight bounds on maximal and maximum matchings (Q1877645) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- Maximum matching in regular and almost regular graphs (Q1949755) (← links)
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves (Q2018146) (← links)
- Fair-by-design matching (Q2212506) (← links)
- Decomposition of university course timetabling. A systematic study of subproblems and their complexities (Q2241151) (← links)
- On strong proper connection number of cubic graphs (Q2312653) (← links)
- Distributed edge coloration for bipartite networks (Q2377126) (← links)
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs (Q2419108) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- Path multicoloring with fewer colors in spiders and caterpillars (Q2460919) (← links)
- New linear-time algorithms for edge-coloring planar graphs (Q2479530) (← links)
- A note on 3D orthogonal graph drawing (Q2486752) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- Using the minimum maximum flow degree to approximate the flow coloring problem (Q2675725) (← links)
- Randomized Δ-edge colouring via exchanges of complex colours (Q2868167) (← links)
- Solving Matching Problems Efficiently in Bipartite Graphs (Q2946048) (← links)
- Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
- Wavelength assignment in multifiber star networks (Q3057165) (← links)
- TRIANGLE-FREE 2-MATCHINGS REVISITED (Q3084696) (← links)
- On Rearrangement of Items Stored in Stacks (Q3382003) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP (Q5090157) (← links)
- On a routing Open Shop Problem on two nodes with unit processing times (Q5090158) (← links)
- Space-Efficient Euler Partition and Bipartite Edge Coloring (Q5283378) (← links)
- Repeatedly matching items to agents fairly and efficiently (Q6118303) (← links)
- Arbitrary-size permutation networks using arbitrary-radix switches (Q6159027) (← links)