✦ LIBER ✦

On extremal cases of Hopcroft’s algorithm

✍ Scribed by G. Castiglione; A. Restivo; M. Sciortino

Book ID: 108281651
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 451 KB
Volume: 411
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.05.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average complexity of Moore’s and Hopcro

Average complexity of Moore’s and Hopcroft’s algorithms

✍ Julien David 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 545 KB

On the embedding phase of the Hopcroft a

On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm

✍ K. Mehlhorn and P. Mutzel 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 200 KB

Characterizing Extremal Digraphs for Ide

Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy’s Theorem on Induced Subsets

✍ Florent Foucaud, Reza Naserasr, Aline Parreau 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 240 KB

Extremal cases of the Pompeiu problem

✍ V. V. Volchkov 📂 Article 📅 1996 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 479 KB

Extremal Cases of the Ahlswede–Cai Inequ

Extremal Cases of the Ahlswede–Cai Inequality

✍ A.J. Radcliffe; Zs. Szaniszló 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 645 KB

Consider two set systems A and B in the powerset P(n) with the property that for each A # A there exists a unique B # B such that A/B. Ahlswede and Cai proved an inequality about such systems which is a generalization of the LYM and Bolloba s inequalities. In this paper we characterize the structure

ON AN EXTREME CASE OF EXOSTOSIS

✍ PRICE, W 📂 Article 📅 1863 🏛 The Lancet 🌐 English ⚖ 391 KB