Matches in DBpedia 2016-04 for { <http://doi.org/10.1016/s0304-0208(08)73110-4> ?p ?o }
Showing triples 1 to 13 of
13
with 100 triples per page.
- s0304-0208(08)73110-4 contribution "How to find long paths efficiently".
- s0304-0208(08)73110-4 doi "10.1016/S0304-020873110-4".
- s0304-0208(08)73110-4 first "B.".
- s0304-0208(08)73110-4 isCitedBy Longest_path_problem.
- s0304-0208(08)73110-4 last "Monien".
- s0304-0208(08)73110-4 location "Amsterdam".
- s0304-0208(08)73110-4 mr "808004".
- s0304-0208(08)73110-4 pages "239–254".
- s0304-0208(08)73110-4 publisher "North-Holland".
- s0304-0208(08)73110-4 series "North-Holland Math. Stud.".
- s0304-0208(08)73110-4 title "Analysis and design of algorithms for combinatorial problems".
- s0304-0208(08)73110-4 volume "109".
- s0304-0208(08)73110-4 year "1985".