Daniel Goncalves

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The induced arboricity of a graph G is the smallest number of induced forests covering the edges of G. This is a well-defined parameter bounded from above by the number of edges of G when each forest in a cover consists of exactly one edge. Not all edges of a graph necessarily belong to induced forests with larger components. For k 1, we call an edge(More)
—The management of complex network infrastruc-tures continues to be a difficult endeavor today. These infrastruc-tures can contain a huge number of devices that may misbehave in unpredictable ways. Many of these devices keep logs that contain valuable information about the infrastructures' security, reliability, and performance. However, extracting(More)
  • 1