Matches in DBpedia 2015-10 for { <http://doi.org/10.1007/s10898-006-9039-7> ?p ?o }
Showing triples 1 to 12 of
12
with 100 triples per page.
- s10898-006-9039-7 doi "10.1007/s10898-006-9039-7".
- s10898-006-9039-7 first1 "E.".
- s10898-006-9039-7 first2 "T.".
- s10898-006-9039-7 isCitedBy Clique_problem.
- s10898-006-9039-7 issue "1".
- s10898-006-9039-7 journal "Journal of Global Optimization".
- s10898-006-9039-7 last1 "Tomita".
- s10898-006-9039-7 last2 "Kameda".
- s10898-006-9039-7 pages "95–111".
- s10898-006-9039-7 title "An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments".
- s10898-006-9039-7 volume "37".
- s10898-006-9039-7 year "2007".