Matches in DBpedia 2016-04 for { <http://doi.org/10.1007/s00224-005-1254-y> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- s00224-005-1254-y author2Link "Kurt Mehlhorn".
- s00224-005-1254-y doi "10.1007/s00224-005-1254-y".
- s00224-005-1254-y first1 "Holger".
- s00224-005-1254-y first2 "Kurt".
- s00224-005-1254-y first3 "Guido".
- s00224-005-1254-y first4 "Hisao".
- s00224-005-1254-y isCitedBy Hopcroft–Karp_algorithm.
- s00224-005-1254-y issue "1".
- s00224-005-1254-y journal "Theory of Computing Systems".
- s00224-005-1254-y last1 "Bast".
- s00224-005-1254-y last2 "Mehlhorn".
- s00224-005-1254-y last3 "Schafer".
- s00224-005-1254-y last4 "Tamaki".
- s00224-005-1254-y pages "3–14".
- s00224-005-1254-y title "Matching algorithms are fast in sparse random graphs".
- s00224-005-1254-y volume "39".
- s00224-005-1254-y year "2006".