74 search results - page 1 / 15 » Algorithms for Generating Convex Sets in Acyclic Digraphs |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
CORR
2004
Springer
13 years 10 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
AI
2002
Springer
13 years 10 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
IWPEC
2009
Springer
14 years 5 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...