Asymptotic Enumeration of Extensional Acyclic Digraphs

ISSN： 0178-4617

Source： Algorithmica, Vol.66, Iss.4, 2013-08, pp. : 829-847

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem: The Acyclic Case

By Romeijn H. Edwin Morales Dolores Romero

Journal of Heuristics, Vol. 10, Iss. 1, 2004-01 ,pp. : 5-35

Springer Publishing Company

Access to resources Recommend Favorite

On the structure of minimum broadcast digraphs

By Fertin G.

Theoretical Computer Science, Vol. 245, Iss. 2, 2000-08 ,pp. : 203-216

Elsevier

Access to resources Recommend Favorite

A Broadcasting Protocol in Line Digraphs

By Bermond J-C. Muñoz X. Marchetti-Spaccamela A.

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 8, 2001-08 ,pp. : 1013-1032

Academic Press

Access to resources Recommend Favorite

Confluence of extensional and non-extensional -calculi with explicit substitutions

By Kesner D.

Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. : 183-220

Elsevier

Access to resources Recommend Favorite

On Absorbing Cycles in Min–Max Digraphs

By Günzel Harald Jongen Hubertus

Journal of Global Optimization, Vol. 31, Iss. 1, 2005-01 ,pp. : 85-92

Springer Publishing Company

Access to resources Recommend Favorite