Computing minimal spanning subgraphs in linear time

Han, Xiaofeng; Kelsen, Pierre; Ramachandran, Vijaya; Tarjan, Robert E.

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1331830_3

DetailsSummary

Computing minimal spanning subgraphs in linear time

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC72-1 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC73-0

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Han, Xiaofeng, Author
Kelsen, Pierre¹, Author
Ramachandran, Vijaya, Author
Tarjan, Robert E., Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1995

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517764
Other: Local-ID: C1256428004B93B8-6BD3458A2B93219FC125645A0047EBBE-Kelsen-et-al95

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: SIAM Journal on Computing

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 24 (6) Sequence Number: - Start / End Page: 1332 - 1358 Identifier: ISSN: 0097-5397