Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Minimum projective linearizations of trees in linear time

From MaRDI portal
Publication:2059886
Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2059886&oldid=14539671"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 20:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki