Sciweavers

151 search results - page 10 / 31
» Hyperbolic Graphs of Small Complexity
Sort
View
FLAIRS
2006
13 years 11 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch
JSAC
2011
116views more  JSAC 2011»
13 years 4 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao
JGAA
2006
127views more  JGAA 2006»
13 years 9 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
WAW
2009
Springer
138views Algorithms» more  WAW 2009»
14 years 4 months ago
Information Theoretic Comparison of Stochastic Graph Models: Some Experiments
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
Kevin J. Lang
COR
2006
65views more  COR 2006»
13 years 10 months ago
An exact method for graph coloring
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
Corinne Lucet, Florence Mendes, Aziz Moukrim