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

An algorithm for partitioning trees augmented with sibling edges

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

DOI10.1016/J.IPL.2008.04.010zbMath1191.68893OpenAlexW2035890212MaRDI QIDQ975430

Rajesh Bordawekar, Oded Shmueli

Publication date: 9 June 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.04.010


zbMATH Keywords

algorithmsanalysis of algorithmsgraph algorithms


Mathematics Subject Classification ID

Analysis of algorithms (68W40)


Related Items (1)

A tight bound on the min-ratio edge-partitioning problem of a tree




Cites Work

  • Unnamed Item
  • Parallel concepts in graph theory
  • A Linear Tree Partitioning Algorithm
  • A model for the evaluation of storage hierarchies




This page was built for publication: An algorithm for partitioning trees augmented with sibling edges

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