Skip to content

Opening book details…

About this Computer Science article

Computing the differential of a graph: Hardness, approximability and exact algorithms by Bermudo, S.; Fernau, H. is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Bermudo, S.; Fernau, H.
Publisher
Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
Published
2014
Language
EN
Field
Computer Science (Physical Sciences)

More by Bermudo, S.; Fernau, H.

Browse all works by Bermudo, S.; Fernau, H.