Minimum projective linearizations of trees in linear time

DOI10.1016/j.ipl.2021.106204OpenAlexW3201001134MaRDI QIDQ2059886

Juan Luis Esteban, Lluís Alemany-Puig, Ramon Ferrer-i-Cancho

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.03277

zbMATH Keywords

algorithmsplanarityprojectivityminimum linear arrangement problemone-page embeddings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

The maximum linear arrangement problem for trees under projectivity and planarity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On optimal linear arrangements of trees
• Optimal one-page tree embeddings in linear time
• The book thickness of a graph
• Some simplified NP-complete graph problems
• A Minimum Linear Arrangement Algorithm for Undirected Trees

This page was built for publication: Minimum projective linearizations of trees in linear time