Edge-coloring bipartite multigraphs in O(E D) time
From MaRDI portal
Publication:873646
Recommendations
Cited in
(52)- Chromatic scheduling in a cyclic open shop
- Trees, paths, stars, caterpillars and spiders
- Distributed edge coloration for bipartite networks
- Space-Efficient Euler Partition and Bipartite Edge Coloring
- A simple algorithm for edge-coloring bipartite multigraphs
- On strong proper connection number of cubic graphs
- On a routing open shop problem on two nodes with unit processing times
- Path multicoloring with fewer colors in spiders and caterpillars
- Colorful strips
- A note on 3D orthogonal graph drawing
- Fair-by-design matching
- Computing large matchings in planar graphs with fixed minimum degree
- Space-efficient Euler partition and bipartite edge coloring
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
- Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
- Just-in-time scheduling with equal-size jobs
- The power of multi-step Vizing chains
- On the enumeration of bipartite minimum edge colorings
- Arbitrary-size permutation networks using arbitrary-radix switches
- Compact scheduling of zero-one time operations in multi-stage systems
- Triangle-free 2-matchings revisited
- Edge Bipartization Faster Than 2^k
- Complete Complexity Classification of Short Shop Scheduling
- Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs
- Solving matching problems efficiently in bipartite graphs
- New linear-time algorithms for edge-coloring planar graphs
- Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs
- A simple matching algorithm for regular bipartite graphs.
- Polynomial time complexity of edge colouring graphs with bounded colour classes
- Decomposition of university course timetabling. A systematic study of subproblems and their complexities
- A complete 4-parametric complexity classification of short shop scheduling problems
- Randomized Δ-edge colouring via exchanges of complex colours
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
- Algorithms for edge coloring bipartite graphs
- Maximum matching in regular and almost regular graphs
- A polynomial algorithm with asymptotic ratio \(2/3\) for the asymmetric maximization version of the \(m\)-PSP
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
- On rearrangement of items stored in stacks
- Path problems in generalized stars, complete graphs, and brick wall graphs
- Enumeration algorithm for the edge coloring problem on bipartite graphs
- Wavelength assignment in multifiber star networks
- Using the minimum maximum flow degree to approximate the flow coloring problem
- Approximate constrained bipartite edge coloring
- Subset matching and edge coloring in bipartite graphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Classes of perfect graphs
- Repeatedly matching items to agents fairly and efficiently
- Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks
- Edge Colouring with Delays
- Approximating the max-edge-coloring problem
- Tight bounds on maximal and maximum matchings
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)
