𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Decomposition of structural learning about directed acyclic graphs

✍ Scribed by Xianchao Xie; Zhi Geng; Qiang Zhao

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
310 KB
Volume
170
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the chromatic spectrum of acyclic dec
On the chromatic spectrum of acyclic decompositions of graphs
✍ Robert E. Jamison; Eric Mendelsohn πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 243 KB

## Abstract If __G__ is any graph, a __G‐decomposition__ of a __host__ graph __H__ = (__V__, __E__) is a partition of the edge set of __H__ into subgraphs of __H__ which are isomorphic to __G__. The __chromatic index__ of a __G__‐decomposition is the minimum number of colors required to color the p

Directed star decompositions of the comp
Directed star decompositions of the complete directed graph
✍ Charles J. Colbourn; D. G. Hoffman; C. A. Rodger πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 545 KB

## Abstract An (__s, t__)‐directed star is a directed graph with __s__ + __t__ + 1 vertices and s + t arcs; s vertices have indegree zero and outdegree one, __t__ have indegree one and outdegree zero, and one has indegree __s__ and outdegree __t__. An (__s, t__)‐directed star decomposition is a par

The incremental maintenance of a Depth-F
The incremental maintenance of a Depth-First-Search tree in directed acyclic graphs
✍ Paolo G. Franciosa; Giorgio Gambosi; Umberto Nanni πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 748 KB

We propose an incremental algorithm to maintain a DFS-forest in a directed acyclic graph under a sequence of arc insertions in 0( nm) worst case total time, where n is the number of nodes and m is the number of arcs after the insertions. This compares favorably with the time required to recompute DF