Sciweavers

1736 search results - page 43 / 348
» The rank-width of Directed Graphs
Sort
View
JMLR
2010
143views more  JMLR 2010»
14 years 5 months ago
Beware of the DAG!
Directed acyclic graph (DAG) models are popular tools for describing causal relationships and for guiding attempts to learn them from data. In particular, they appear to supply a ...
A. Philip Dawid
ESA
2011
Springer
231views Algorithms» more  ESA 2011»
13 years 10 months ago
Distribution-Aware Compressed Full-Text Indexes
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
Paolo Ferragina, Jouni Sirén, Rossano Ventu...
NETWORK
2010
122views more  NETWORK 2010»
14 years 5 months ago
Betweenness centrality and resistance distance in communication networks
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
Ali Tizghadam, Alberto Leon-Garcia
WDAG
1998
Springer
98views Algorithms» more  WDAG 1998»
15 years 2 months ago
Sense of Direction in Distributed Computing
Sense of direction is a property of labeled graphs which has been shown to have a de
Paola Flocchini, Bernard Mans, Nicola Santoro
ICALP
2007
Springer
15 years 4 months ago
Parameterized Algorithms for Directed Maximum Leaf Problems
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...