de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Computing minimal spanning subgraphs in linear time

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44755

Kelsen,  Pierre
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Han, X., Kelsen, P., Ramachandran, V., & Tarjan, R. E. (1995). Computing minimal spanning subgraphs in linear time. SIAM Journal on Computing, 24(6), 1332-1358.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-AC72-1
Abstract
There is no abstract available