Oded Kariv

According to our database, Oded Kariv authored at least 6 papers between 1975 and 1986.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1986

A generalization of edge-coloring in graphs.

S. Louis Hakimi, Oded Kariv

J. Graph Theory, 1986

1985

Algorithms for finding P-centers on a weighted tree (for relatively small P).

M. Jeger, Oded Kariv

Networks, 1985

1984

Midwest theory of computation symposium: on a generalization of edge-coloring in graphs.

S. Louis Hakimi, Oded Kariv

SIGACT News, 1984

1982

Algorithms for Edge Coloring Bipartite Graphs and Multigraphs.

Harold N. Gabow, Oded Kariv

SIAM J. Comput., 1982

1978

Algorithms for Edge Coloring Bipartite Graphs

Harold N. Gabow, Oded Kariv

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1975

An O(n^2.5) Algorithm for Maximum Matching in General Graphs

Shimon Even, Oded Kariv

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975