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

Bandwidth sums of block graphs and cacti

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

DOI10.1007/s10878-012-9548-xzbMath1291.90281OpenAlexW2043898012MaRDI QIDQ2015805

Yanyan Li

Publication date: 24 June 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9548-x


zbMATH Keywords

labelingblock graphcactusbandwidth sumblock-cut-vertex graph


Mathematics Subject Classification ID

Dynamic programming (90C39)




Cites Work

  • On optimal linear arrangements of trees
  • Optimal Assignments of Numbers to Vertices
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Bandwidth sums of block graphs and cacti

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2015805&oldid=14487559"
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 18:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki