Pages that link to "Item:Q3946187"
From MaRDI portal
The following pages link to Algorithms for Edge Coloring Bipartite Graphs and Multigraphs (Q3946187):
Displayed 28 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)
- A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924) (← links)
- Optimally edge-colouring outerplanar graphs is in NC (Q909461) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- Space-efficient Euler partition and bipartite edge coloring (Q1628587) (← links)
- Path colorings in bipartite graphs (Q1767676) (← links)
- A generalized class-teacher model for some timetabling problems (Q1848400) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
- Maximum matching in regular and almost regular graphs (Q1949755) (← links)
- On a conjecture for the university timetabling problem (Q2028068) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Distributed edge coloration for bipartite networks (Q2377126) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints (Q2576249) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- Efficient Vertex- and Edge-Coloring of Outerplanar Graphs (Q3705474) (← links)
- Open shop problems with unit time operations (Q4031970) (← links)
- Distributed algorithms for maximum cliques (Q4338575) (← links)
- Space-Efficient Euler Partition and Bipartite Edge Coloring (Q5283378) (← links)
- An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links (Q5954827) (← links)
- Edge coloring of bipartite graphs with constraints (Q5958313) (← links)