Mark B. Novick

According to our database, Mark B. Novick authored at least 3 papers between 1989 and 1990.

Collaborative distances:

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

1990

An Efficient Reconstruction of a Graph from its Line Graph in Parallel.

Joseph Naor, Mark B. Novick

J. Algorithms, 1990

Fast Parallel Algorithms for the Clique Separator Decomposition.

Elias Dahlhaus, Marek Karpinski, Mark B. Novick

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989

Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw-Free Graphs.

Marek Chrobak, Joseph Naor, Mark B. Novick

Proceedings of the Algorithms and Data Structures, 1989