Cost-minimal trees in directed acyclic graphs
نویسندگان
چکیده
A number of examples are given where one seeks a minimal-cost tree to span a given subset of the nodes of a connected, directed, acyclic graph (we call such a graph monotonic). Some of these examples require an al~orithm to transform the problem into the form of a minimization problem in a monotonic graph.; this algorithm is also given. Finally, an implicit enumeration algorithm is presented for finding the cost-minimal tree of the graph, which spans the designated subset of the nodes, and some computational results are given.
منابع مشابه
Luis Fariñas del Cerro Olivier Gasquet MINIMAL STRUCTURES FOR MODAL TABLEAUX : Some Examples
In this paper we present some examples of decision procedures based on tableau calculus for some monoand multimodal logics having a semantics involving properties that are not easily representable in tree-like structures (like e.g. density, confluence and persistence). We show how to handle them in our framework by generalizing usual tableaux (which are trees) to richer structures: rooted direc...
متن کاملMINIMAL STRUCTURES FOR MODAL TABLEAUX: Some Examples
In this paper we present some examples of decision procedures based on tableau calculus for some monoand multimodal logics having a semantics involving properties that are not easily representable in tree-like structures (like e.g. density, confluence and persistence). We show how to handle them in our framework by generalizing usual tableaux (which are trees) to richer structures: rooted direc...
متن کاملMinimal Sufficient Causation and Directed Acyclic Graphs
Notions of minimal sufficient causation are incorporated within the directed acyclic graph causal framework. Doing so allows for the graphical representation of sufficient causes and minimal sufficient causes on causal directed acyclic graphs while maintaining all of the properties of causal directed acyclic graphs. This in turn provides a clear theoretical link between two major conceptualizat...
متن کاملMinimal Recurrent Configurations of Chip Firing Games and Directed Acyclic Graphs
We discuss a very close relation between minimal recurrent configurations of Chip Firing Games and Directed Acyclic Graphs and demonstrate the usefulness of this relation by giving a lower bound for the number of minimal recurrent configurations of the Abelian Sandpile Model as well as a lower bound for the number of firings which are caused by the addition of two recurrent configurations on pa...
متن کاملInferring Pedigree Graphs from Genetic Distances
In this paper, we study a problem of inferring blood relationships which satisfy a given matrix of genetic distances between all pairs of n nodes. Blood relationships are represented by our proposed graph class, which is called a pedigree graph. A pedigree graph is a directed acyclic graph in which the maximum indegree is at most two. We show that the number of pedigree graphs which satisfy the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Zeitschr. für OR
دوره 18 شماره
صفحات -
تاریخ انتشار 1974