Sciweavers

1736 search results - page 65 / 348
» The rank-width of Directed Graphs
Sort
View
AMC
2008
78views more  AMC 2008»
15 years 4 months ago
Information processing in complex networks: Graph entropy and information functionals
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...
Matthias Dehmer
UAI
2008
15 years 5 months ago
Learning Inclusion-Optimal Chordal Graphs
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...
Vincent Auvray, Louis Wehenkel
WSR
2008
15 years 5 months ago
Graph Technology in Reverse Engineering: The TGraph Approach
: 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...
Jürgen Ebert, Volker Riediger, Andreas Winter
JETAI
1998
110views more  JETAI 1998»
15 years 3 months ago
Independency relationships and learning algorithms for singly connected networks
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...
Luis M. de Campos
SRDS
2010
IEEE
15 years 1 months ago
Shedding Light on Enterprise Network Failures Using Spotlight
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...
Dipu John, Pawan Prakash, Ramana Rao Kompella, Ran...