3 citations · 5 across the 6 of their papers we have counts for
4 papers · 2 filters
Faster Maximium Priority Matchings in Bipartite Graphs
Jonathan Turner
A maximum priority matching is a matching in an undirected graph that maximizes a priority score defined with respect to given vertex priorities. An earlier paper showed how to fin…
The Bounded Edge Coloring Problem and Offline Crossbar Scheduling
Jonathan Turner
This paper introduces a variant of the classical edge coloring problem in graphs that can be applied to an offline scheduling problem for crossbar switches. We show that the proble…
The Edge Group Coloring Problem with Applications to Multicast Switching
Jonathan Turner
This paper introduces a natural generalization of the classical edge coloring problem in graphs that provides a useful abstraction for two well-known problems in multicast switchin…
Maximium Priority Matchings
Jonathan Turner
Let be an undirected graph with vertices and edges, in which each vertex is assigned an integer priority in , with 1 being the "highest" priority. Let…