Matches in DBpedia 2016-04 for { <http://doi.org/10.1007/3-540-45477-2_26> ?p ?o }
Showing triples 1 to 20 of
20
with 100 triples per page.
- 3-540-45477-2_26 contribution "The complexity of the matching-cut problem".
- 3-540-45477-2_26 doi "10.1007/3-540-45477-2_26".
- 3-540-45477-2_26 editor1First "Andreas".
- 3-540-45477-2_26 editor1Last "Brandstädt".
- 3-540-45477-2_26 editor1Link "Andreas Brandstädt".
- 3-540-45477-2_26 editor2First "Van Bang".
- 3-540-45477-2_26 editor2Last "Le".
- 3-540-45477-2_26 first1 "Maurizio".
- 3-540-45477-2_26 first2 "Maurizio".
- 3-540-45477-2_26 isCitedBy Kargers_algorithm.
- 3-540-45477-2_26 last1 "Patrignani".
- 3-540-45477-2_26 last2 "Pizzonia".
- 3-540-45477-2_26 location "Berlin".
- 3-540-45477-2_26 mr "1905640".
- 3-540-45477-2_26 pages "284–295".
- 3-540-45477-2_26 publisher "Springer".
- 3-540-45477-2_26 series "Lecture Notes in Computer Science".
- 3-540-45477-2_26 title "--06-14".
- 3-540-45477-2_26 volume "2204".
- 3-540-45477-2_26 year "2001".