Matches in DBpedia 2015-10 for { <http://doi.org/10.1007/3-540-45066-1_22> ?p ?o }
Showing triples 1 to 14 of
14
with 100 triples per page.
- 3-540-45066-1_22 chapter "An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique".
- 3-540-45066-1_22 doi "10.1007/3-540-45066-1_22".
- 3-540-45066-1_22 first1 "E.".
- 3-540-45066-1_22 first2 "T.".
- 3-540-45066-1_22 isCitedBy Clique_problem.
- 3-540-45066-1_22 isbn "978-3-540-40505-4".
- 3-540-45066-1_22 last1 "Tomita".
- 3-540-45066-1_22 last2 "Seki".
- 3-540-45066-1_22 pages "278–289".
- 3-540-45066-1_22 publisher "Springer-Verlag".
- 3-540-45066-1_22 series "Lecture Notes in Computer Science".
- 3-540-45066-1_22 title "Discrete Mathematics and Theoretical Computer Science".
- 3-540-45066-1_22 volume "2731".
- 3-540-45066-1_22 year "2003".