Sciweavers

3396 search results - page 39 / 680
» Tree representations of graphs
Sort
View
APPROX
2010
Springer
220views Algorithms» more  APPROX 2010»
13 years 10 months ago
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
Victor Chepoi, Feodor F. Dragan, Ilan Newman, Yuri...
IJCAI
2007
13 years 10 months ago
Utile Distinctions for Relational Reinforcement Learning
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
William Dabney, Amy McGovern
SPIRE
2007
Springer
14 years 2 months ago
A Fast and Compact Web Graph Representation
Compressed graphs representation has become an attractive research topic because of its applications to the manipulation of huge Web graphs in main memory. By far the best current ...
Francisco Claude, Gonzalo Navarro
COCOON
2005
Springer
14 years 2 months ago
Bounded Degree Closest k-Tree Power Is NP-Complete
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
Michael Dom, Jiong Guo, Rolf Niedermeier
IJCAI
2001
13 years 10 months ago
Causal interaction: from a high-level representation to an operational event-based representation
We propose to extend the temporal causal graph formalisms used in model-based diagnosis in order to deal with non trivial interactions like (partial) cancellation of fault effects...
Irène Grosclaude, Marie-Odile Cordier, Rene...