{"version.version":"0.0.7","version.cm_url":"https://github.com/ceurws/ceur-spt","spt.html_url":"/Vol-1287/lanmr2014_paper_4.html","spt.description":null,"spt.id":"Vol-1287/lanmr2014_paper_4","spt.wikidataid":null,"spt.title":"Low - exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs","spt.pdfUrl":"https://ceur-ws.org/Vol-1287/lanmr2014_paper_4.pdf","spt.volume":{"number":1287,"acronym":"LANMR 2014","wikidataid":"Q113544742","title":"Proceedings of the Ninth Latin American Workshop on Logic/Languages, Algorithms and New Methods of Reasoning","description":"Proceedings of LANMR 2014 workshop","url":"http://ceur-ws.org/Vol-1287/","date":"2014-11-05","dblp":"conf/lanmr/2014","k10plus":"1019695102","urn":"urn:nbn:de:0074-1287-8"},"spt.session":null,"cvb.id":"Vol-1287/lanmr2014_paper_4","cvb.title":"Low - exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs","cvb.type":null,"cvb.position":null,"cvb.pagesFrom":null,"cvb.pagesTo":null,"cvb.authors":"","cvb.vol_number":"1287","cvb.pdf_name":"lanmr2014_paper_4.pdf","cvb.pages":"8","cvb.fail":null,"dblp.dblp_publication_id":"https://dblp.org/rec/conf/lanmr/ServinML14","dblp.dblp_proceeding_id":"https://dblp.org/rec/conf/lanmr/2014","dblp.volume_number":1287,"dblp.title":"Low - exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs.","dblp.authors":[{"dblp_author_id":"https://dblp.org/pid/04/5876","label":"José Raymundo Marcial-Romero","wikidata_id":"Q62056412","orcid_id":"0000-0002-5808-5727","gnd_id":null},{"dblp_author_id":"https://dblp.org/pid/47/7296","label":"José Antonio Hernández Servín","wikidata_id":null,"orcid_id":null,"gnd_id":null},{"dblp_author_id":"https://dblp.org/pid/86/5311","label":"Guillermo De Ita Luna","wikidata_id":null,"orcid_id":"0000-0001-7948-8253","gnd_id":null}],"dblp.pdf_id":"Vol-1287/lanmr2014_paper_4"}