Matches in DBpedia 2016-04 for { <http://doi.org/10.1016/s0304-3975(00)00286-3> ?p ?o }
Showing triples 1 to 10 of
10
with 100 triples per page.
- s0304-3975(00)00286-3 doi "10.1016/S0304-397500286-3".
- s0304-3975(00)00286-3 first "Ina".
- s0304-3975(00)00286-3 isCitedBy Bron–Kerbosch_algorithm.
- s0304-3975(00)00286-3 issue "1–2".
- s0304-3975(00)00286-3 journal "Theoretical Computer Science".
- s0304-3975(00)00286-3 last "Koch".
- s0304-3975(00)00286-3 pages "1–30".
- s0304-3975(00)00286-3 title "Enumerating all connected maximal common subgraphs in two graphs".
- s0304-3975(00)00286-3 volume "250".
- s0304-3975(00)00286-3 year "2001".