𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Möbius function for the set of acyclic directed backbone graphs

✍ Scribed by D. K. Arrowsmith; J. W. Essam

Publisher
Springer
Year
1990
Tongue
English
Weight
917 KB
Volume
58
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal problems for the Möbius functio
Extremal problems for the Möbius function in the face lattice of the n-octahedron
✍ Margaret A. Readdy 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 902 KB

We study extremal problems concerning the M6bius function kt of certain families of subsets from 0,, the lattice of faces of the n-dimensional octahedron. For lower order ideals ff from O,, tP(~}] attains a unique maximum by taking ff to be the lower two-thirds of the ranks of the poset. Stanley sho

A simulated annealing algorithm with the
A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs
✍ Taichi Kaji; Azuma Ohuchi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 240 KB

In this paper, we present an approach for ®nding a minimum cost partition of the nodes of a directed acyclic graph into subsets of a given size, subject to the constraint that the precedence relationships among the elements are satis®ed, based on the concept of simulated annealing. Simulated anneali