English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$

Alt, H., Blum, N., Mehlhorn, K., & Paul, M. (1991). Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$. Information Processing Letters, 37, 237-240.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE27-C Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE28-A
Genre: Journal Article

Files

show Files
hide Files
:
Mehlhorn90.pdf (Publisher version), 3MB
 
File Permalink:
-
Name:
Mehlhorn90.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Alt, Helmut1, Author
Blum, Norbert1, Author
Mehlhorn, Kurt2, Author           
Paul, Markus2, Author           
Affiliations:
1Max Planck Society, ou_persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2008-01-211991
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344536
Other: Local-ID: C1256428004B93B8-B4DF44F2395B88EBC125707E0041B339-Mehlhorn91a
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Information Processing Letters
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 37 Sequence Number: - Start / End Page: 237 - 240 Identifier: -