This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
: TGraphs are directed graphs with typed, attributed, and ordered nodes and edges. These properties leverage the use of graphs as models for all kinds of artifacts in the context o...
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...