𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for maximum linear arrangement

✍ Scribed by Refael Hassin; Shlomi Rubinstein

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
92 KB
Volume
80
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Linear-time Algorithms for Maximum Sets
Linear-time Algorithms for Maximum Sets of Sources and sinks
✍ Celina M.H. de Figueiredo; John Gimbel; CΓ©lia Picinin de Mello; Jayme L. Szwarcf πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 255 KB

Let G denote a simple non-trivial connected undirected graph, with vertex set V (G) and edge set E(G). Write n = jV (G)j and m = jE(G)j. L e t G represent an acyclic orientation of G. We say that G is transitive when (v w) (w z) 2 E( G) implies (v z) 2 E( G), for all v w z2 V (G) and we say that G i