3396 search results - page 167 / 680 » Tree representations of graphs |
IPL
2006
13 years 9 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
JMLR
2010
13 years 3 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
PDCAT
2005
Springer
14 years 2 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
CGF
2008
13 years 9 months ago
2008
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...