Journal of Experimental Algorithmics (JEA)
Linear reductions of maximum matching
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Edge coloring of bipartite graphs with constraints
Theoretical Computer Science
A simple matching algorithm for regular bipartite graphs
Information Processing Letters
Gridline graphs: a review in two dimensions and an extension to higher dimensions
Discrete Applied Mathematics
Routing Permutations in Partitioned Optical Passive Star Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Edge Coloring of Bipartite Graphs with Constraints
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Tight Bounds on Maximal and Maximum Matchings
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An Algorithm That Builds a Set of Strings Given Its Overlap Graph
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Approximate Constrained Bipartite Edge Coloring
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
A simple algorithm for edge-coloring bipartite multigraphs
Information Processing Letters
Routing permutations in partitioned optical passive stars networks
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Approximate constrained bipartite edge coloring
Discrete Applied Mathematics
Dynamic wavelength assignment for WDM all-optical tree networks
IEEE/ACM Transactions on Networking (TON)
Latin squares with bounded size of row prefix intersections
Discrete Applied Mathematics
On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks
IEEE/ACM Transactions on Networking (TON)
Approximating fluid schedules in crossbar packet-switches and Banyan networks
IEEE/ACM Transactions on Networking (TON)
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Perfect matchings via uniform sampling in regular bipartite graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Further investigations into regular XORSAT
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Adaptively parallelizing distributed range queries
Proceedings of the VLDB Endowment
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Note: Latin squares with bounded size of row prefix intersections
Discrete Applied Mathematics
Perfect matchings via uniform sampling in regular bipartite graphs
ACM Transactions on Algorithms (TALG)
Distributed edge coloration for bipartite networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Perfect matchings in o(n log n) time in regular bipartite graphs
Proceedings of the forty-second ACM symposium on Theory of computing
One-to-Many: Context-Oriented Code for Concurrent Error Detection
Journal of Electronic Testing: Theory and Applications
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
GD'10 Proceedings of the 18th international conference on Graph drawing
Computing large matchings in planar graphs with fixed minimum degree
Theoretical Computer Science
A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is small
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Hi-index | 0.01 |
We show that a minimum edge coloring of a bipartite graph can be found in $O(\Delta m)$ time, where $\Delta$ and m denote the maximum degree and the number of edges of G, respectively. It is equivalent to finding a perfect matching in a k-regular bipartite graph in O(km) time.By sharpening the methods, a minimum edge coloring of a bipartite graph can be found in $O((p_{\max}(\Delta)+\log \Delta)m)$ time, where $p_{\max}(\Delta)$ is the largest prime factor of $\Delta$. Moreover, a perfect matching in a k-regular bipartite graph can be found in O(pmax(k)m)time.