☆ 4.2 Article

The maximum linear arrangement problem for trees under projectivity and planarity

INFORMATION PROCESSING LETTERS (2024)

Related references

Note: Only part of the references are listed.

Article Computer Science, Information Systems

Minimum projective linearizations of trees in linear time

Lluis Alemany-Puig et al.

Summary: The Minimum Linear Arrangement problem involves finding a mapping from graph vertices to distinct integers to minimize a specific formula. Various algorithms exist to solve this problem for trees in polynomial time. There are variants of MLA with constrained arrangements.

INFORMATION PROCESSING LETTERS (2022)

Add to Collection

Article Language & Linguistics