The following pages link to On Edge Coloring Bipartite Graphs (Q3947136):
Displaying 28 items.
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
- Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks (Q841605) (← links)
- A simple algorithm for edge-coloring bipartite multigraphs (Q1007547) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Data transfers in networks (Q1097687) (← links)
- The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984) (← links)
- Some results concerning the complexity of restricted colorings of graphs (Q1186161) (← links)
- An implicit data structure for searching a multikey table in logarithmic time (Q1186547) (← links)
- Interval edge coloring of a graph with forbidden colors (Q1309462) (← links)
- Minimizing the total completion time in a unit-time open shop with release times (Q1362528) (← links)
- Open shop problem with zero-one time operations and integer release date/deadline intervals (Q1363753) (← links)
- Routing and path multicoloring (Q1607124) (← links)
- Space-efficient Euler partition and bipartite edge coloring (Q1628587) (← links)
- A simple matching algorithm for regular bipartite graphs. (Q1853135) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- A linear time algorithm for edge coloring of binomial trees (Q1916114) (← links)
- Multicolor routing in the undirected hypercube (Q1971219) (← links)
- An algorithm for improved delay-scaling in input-queued switches (Q2124907) (← links)
- A note on 3D orthogonal graph drawing (Q2486752) (← links)
- Latin squares with bounded size of row prefix intersections (Q2492205) (← links)
- A Markov chain on the solution space of edge colorings of bipartite graphs (Q2696608) (← links)
- A heuristic for decomposing traffic matrices in TDMA satellite communication (Q4277996) (← links)
- Solving fundamental problems on sparse-meshes (Q5054864) (← links)
- Space-Efficient Euler Partition and Bipartite Edge Coloring (Q5283378) (← links)
- Edge coloring of bipartite graphs with constraints (Q5958313) (← links)
- Edge coloring graphs with large minimum degree (Q6094039) (← links)
- Arbitrary-size permutation networks using arbitrary-radix switches (Q6159027) (← links)
- Enumeration algorithm for the edge coloring problem on bipartite graphs (Q6567666) (← links)
