Let V , E, and D denote the cardinality of the vertex set, the cardinality of the edge set, and the maximum degree of a bipartite multigraph G. We show that a minimal edgecoloring of G can be computed in O(E log D) time. This result follows from an algorithm for finding a matching in a regular bipartite graph in O(E) time. Classification (1991): 68W05, 68W40
Mathematics Subject
We consider arithmetic expressions over operators + , - , * , / , and $\sqrt[k]$ , with integer operands. For an expression E having value $\xi$ , a separation bound sep (E) is a positive real number with the property that $\xi\neq$ 0 implies $|\xi | \geq$ sep (E) . We propose a new separation bound that is easy to compute and stronger than previous bounds
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.