Edge-coloring bipartite multigraphs in O(E D) time

Cited In (45)

Fair-by-design matching
A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP
Arbitrary-size permutation networks using arbitrary-radix switches
Edge Bipartization Faster Than 2^k
New linear-time algorithms for edge-coloring planar graphs
Path multicoloring with fewer colors in spiders and caterpillars
Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks
Wavelength assignment in multifiber star networks
Computing large matchings in planar graphs with fixed minimum degree
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
Approximate constrained bipartite edge coloring
Space-efficient Euler partition and bipartite edge coloring
Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
Compact scheduling of zero-one time operations in multi-stage systems
On a routing Open Shop Problem on two nodes with unit processing times
Tight bounds on maximal and maximum matchings
A note on 3D orthogonal graph drawing
Maximum matching in regular and almost regular graphs
Path problems in generalized stars, complete graphs, and brick wall graphs
A self-stabilizing $(\Delta +4)$-edge-coloring algorithm for planar graphs in anonymous uniform systems
Just-in-Time Scheduling with Equal-Size Jobs
Chromatic scheduling in a cyclic open shop
Distributed edge coloration for bipartite networks
A simple matching algorithm for regular bipartite graphs.
Randomized Δ-edge colouring via exchanges of complex colours
Classes of perfect graphs
Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph
On Rearrangement of Items Stored in Stacks
Solving Matching Problems Efficiently in Bipartite Graphs
Using the minimum maximum flow degree to approximate the flow coloring problem
Trees, paths, stars, caterpillars and spiders
A complete 4-parametric complexity classification of short shop scheduling problems
Colorful strips
The power of multi-step Vizing chains
Complete Complexity Classification of Short Shop Scheduling
On strong proper connection number of cubic graphs
An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
Approximating the max-edge-coloring problem
Space-Efficient Euler Partition and Bipartite Edge Coloring
Subset matching and edge coloring in bipartite graphs
Decomposition of university course timetabling. A systematic study of subproblems and their complexities
Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
Repeatedly matching items to agents fairly and efficiently
TRIANGLE-FREE 2-MATCHINGS REVISITED
A simple algorithm for edge-coloring bipartite multigraphs

This page was built for publication: Edge-coloring bipartite multigraphs in $O(E \log D)$ time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q873646)