Depth-first K-trees and critical path analysis

Random increasing k-trees represent an interesting, useful class of strongly dependent graphs that have been studied widely, including being used recently as models for complex networks. We study in this paper an informative notion called connectivity-profile and derive, by several analytic means, asymptotic estimates for its expected value, together with the limiting distribution in certain cases; some interesting consequences predicting more precisely the shapes of random k-trees are also given. Our methods of proof rely essentially on a bijection between k-trees and ordinary trees, and the resolution of a linear system.

show abstract

“…Notice that the term 'k-tree' has also been used in several other areas with very different meanings; see for example [7,23,34,37,40,45,53].…”

Section: K-trees and Other Recursive Structuresmentioning

confidence: 99%

Shape Measures of Random Increasing k-trees

Darrasse¹,

Hwang²,

Soria³

2016

Combinator. Probab. Comp.

View full text Add to dashboard Cite

show abstract

“…Charnes et. al., 1964;Berztiss, 1980;Anderson and Hales, 1986;Friedman and Seaton, 1998;Saidi, 2009). …”

Section: Main Hypothesesmentioning

confidence: 99%

Using Critical Path Analysis (CPA) in Place Marketing Process: A Methodological Approach in the Case of Rostock, Germany

Metaxas

Deffner

2015

ESR&P

View full text Add to dashboard Cite

“…An example of this is provided by an algorithm for strong components of a digraph in which a tree representation of the digraph is traversed under preorder and postorder, with the two traversals intermeshed [3].…”

Section: Data Structures and Iterationmentioning

confidence: 99%

Data abstraction, controlled iteration, and communicating processes

Berztiss¹

1980

Proceedings of the ACM 1980 Annual Conference on - ACM 80

View full text Add to dashboard Cite

Iterators provide access to elements of an abstract structured object in some sequence.It is argued that parallel composition of iterators should be achieved implicitly by means of a generalized for loop rather than by use of mutually interacting coroutines.The generalized for loop employs controlled iteration, which is shown to be a powerful yet inexpensive construct.The generalized for loop is consistent with block structure, and, for program proof purposes, is much more tractable than an unrestricted loop.Concrete programming examples are used extensively. i. Data structures and iterationWhen a programming language permits the specification of abstract data types, there arises the question of how much properly belongs to the specification.Our intent is to contribute to the answer to this question.For the purposes of this discussion it will be assumed that a data type is visible to a programmer merely as the values delivered by a set of access functions.

show abstract

Depth-first K-trees and critical path analysis

Cited by 8 publications

References 10 publications

Shape Measures of Random Increasing k-trees

Shape Measures of Random Increasing k-trees

Using Critical Path Analysis (CPA) in Place Marketing Process: A Methodological Approach in the Case of Rostock, Germany

Data abstraction, controlled iteration, and communicating processes

Contact Info

Product

Resources

About