Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by: Display records with Fulltext only
Entries: 1-4  
 Basket 
Matching Algorithms are Fast in Sparse Random Graphs
Authors: Bast, Holger; Mehlhorn, Kurt; Schäfer, Guido; Tamaki, Hisao
Date of Publication (YYYY-MM-DD): 2006
Title of Journal: Theory of Computing Systems
Volume: 39
Start Page: 3
End Page: 14
Document Type: Article
ID: 314609.0
Matching Algorithms Are Fast in Sparse Random Graphs
Editors: Diekert, Volker; Habib, Michel
Authors: Bast, Holger; Mehlhorn, Kurt; Schäfer, Guido; Tamaki, Hisao
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2004
Title of Proceedings: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04)
Start Page: 81
End Page: 92
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 231169.0
Matching Algorithms Are Fast in Sparse Random Graphs
Editors: Diekert, Volker; Habib, Michel
Authors: Bast, Holger; Mehlhorn, Kurt; Schäfer, Guido; Tamaki, Hisao
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 2004
Title of Proceedings: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04)
Start Page: 81
End Page: 92
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 232070.0
A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
Authors: Bast, Holger; Mehlhorn, Kurt; Schäfer, Guido; Tamaki, Hisao
Date of Publication (YYYY-MM-DD): 2003
Title of Journal: Algorithmica
Volume: 36
Start Page: 75
End Page: 88
Document Type: Article
ID: 201912.0
Entries: 1-4  
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.