186,808 research outputs found
Tarjan path expression code
No full textImplementation of the Tarjan path expression code for calculating paths with structural constraints in semantic graphs.</p
Tylencholaimus brevicaudatus Tarjan 1956
No full text<p> 26. <i>Tylencholaimus</i> <i>brevicaudatus</i> (Tarjan,1953).</p> <p>Monsters 5 en 9. Deze soort is reeds uit Europa bekend (Loof, 1961, Coomans, 1962).</p>Published as part of <i>Rossen, H. v. & Loof, P. A. A., 1962, Notities Over Het Voorkomen Van Enkele Aaltjessoorten In Zweden, pp. 185-188 in Verslagen en Mededelingen Plantenziektenkundige Dienst Wageningen 136</i> on page 187, DOI: <a href="http://zenodo.org/record/10845163">10.5281/zenodo.10845163</a>
Simple Parallel Randomized Connected Components Algorithms
No full textWe study three simple algorithms for concurrently computing connected components in a randomized setting, A, S and P. These algorithms were previously studied in a deterministic setting by Liu and Tarjan, who provided an step bound for A and S, with P remaining unanalyzed.\footnote{We use to denote the base two logarithm} In a randomized setting, we provide and step bounds for A and S respectively, and a bound for P. All results hold with high probability
Simple Parallel Randomized Connected Components Algorithms
No full textWe study three simple algorithms for concurrently computing connected components in a randomized setting, A, S and P. These algorithms were previously studied in a deterministic setting by Liu and Tarjan, who provided an step bound for A and S, with P remaining unanalyzed.\footnote{We use to denote the base two logarithm} In a randomized setting, we provide and step bounds for A and S respectively, and a bound for P. All results hold with high probability
Simple Parallel Randomized Connected Components Algorithms
No full textWe study three simple algorithms for concurrently computing connected components in a randomized setting, A, S and P. These algorithms were previously studied in a deterministic setting by Liu and Tarjan, who provided an step bound for A and S, with P remaining unanalyzed.\footnote{We use to denote the base two logarithm} In a randomized setting, we provide and step bounds for A and S respectively, and a bound for P. All results hold with high probability
On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
No full textWe give a detailed description of the embedding phase of the Hopcroft and Tarjan planarity testing algorithm. The embedding phase runs in linear time. An implementation based on this paper can be found in [Mehlhorn-Mutzel-Naeher-94]
On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
No full textWe give a detailed description of the embedding phase of the Hopcroft and Tarjan planarity testing algorithm. The embedding phase runs in linear time. An implementation based on this paper can be found in [Mehlhorn, Mutzel, Näher, 1993]
Author-wise bibliometric analysis based on entropy.
No full textAuthor-wise bibliometric analysis based on entropy.</p
Improved time bounds for the maximum flow problem
No full textAlso issued as: Working paper (Sloan School of Management) ; WP no. 1966-87Includes bibliographical references (p. 18-19).Research supported by the National Science Foundation. DCR-8605962 Research supported by the Office of Naval Research. NOOO14-87-K-0467by Ravindra K. Ahuja, James B. Orlin and Robert E. Tarjan
- …
