Matches in DBpedia 2016-04 for { <http://doi.org/10.1016/j.tcs.2013.05.026> ?p ?o }
Showing triples 1 to 20 of
20
with 100 triples per page.
- j.tcs.2013.05.026 doi "10.1016/j.tcs.2013.05.026".
- j.tcs.2013.05.026 first1 "Colin".
- j.tcs.2013.05.026 first2 "Jean-Christophe".
- j.tcs.2013.05.026 first3 "Émilie".
- j.tcs.2013.05.026 first4 "Guillaume".
- j.tcs.2013.05.026 first5 "Christine".
- j.tcs.2013.05.026 isCitedBy Subgraph_isomorphism_problem.
- j.tcs.2013.05.026 journal "Theoretical Computer Science".
- j.tcs.2013.05.026 last1 "de la Higuera".
- j.tcs.2013.05.026 last2 "Janodet".
- j.tcs.2013.05.026 last3 "Samuel".
- j.tcs.2013.05.026 last4 "Damiand".
- j.tcs.2013.05.026 last5 "Solnon".
- j.tcs.2013.05.026 mr "3083515".
- j.tcs.2013.05.026 pages "76–99".
- j.tcs.2013.05.026 quote "It is known since the mid-70’s that the isomorphism problem is solvable in polynomial time for plane graphs. However, it has also been noted that the subisomorphism problem is still N P-complete, in particular because the Hamiltonian cycle problem is NP-complete for planar graphs.".
- j.tcs.2013.05.026 title "Polynomial algorithms for open plane graph and subgraph isomorphisms".
- j.tcs.2013.05.026 url hjsds13.pdf.
- j.tcs.2013.05.026 volume "498".
- j.tcs.2013.05.026 year "2013".