Matches in DBpedia 2016-04 for { <http://doi.org/10.1016/s0020-0190(00)00047-8> ?p ?o }
Showing triples 1 to 20 of
20
with 100 triples per page.
- s0020-0190(00)00047-8 doi "10.1016/S0020-019000047-8".
- s0020-0190(00)00047-8 first1 "T.".
- s0020-0190(00)00047-8 first1 "Ton".
- s0020-0190(00)00047-8 first2 "D.".
- s0020-0190(00)00047-8 first2 "Dieter".
- s0020-0190(00)00047-8 first3 "H.".
- s0020-0190(00)00047-8 first3 "Haiko".
- s0020-0190(00)00047-8 isCitedBy Claw-free_graph.
- s0020-0190(00)00047-8 isCitedBy Clique_problem.
- s0020-0190(00)00047-8 issue "3–4".
- s0020-0190(00)00047-8 journal Information_Processing_Letters.
- s0020-0190(00)00047-8 journal "Information Processing Letters".
- s0020-0190(00)00047-8 last1 "Kloks".
- s0020-0190(00)00047-8 last2 "Kratsch".
- s0020-0190(00)00047-8 last3 "Müller".
- s0020-0190(00)00047-8 mr "1761552".
- s0020-0190(00)00047-8 pages "115–121".
- s0020-0190(00)00047-8 title "Finding and counting small induced subgraphs efficiently".
- s0020-0190(00)00047-8 volume "74".
- s0020-0190(00)00047-8 year "2000".