{"labels":{"en":"Low - exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs"},"descriptions":{"en":"scientific paper published in CEUR-WS Volume 1287"},"claims":{"P31":"Q13442814","P1433":"Q113544742","P1476":{"text":"Low - exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs","language":"en"},"P407":"Q1860","P953":"https://ceur-ws.org/Vol-1287/lanmr2014_paper_4.pdf","P50":[{"value":"Q62056412","qualifiers":{"P1545":"1"}}],"P2093":[{"value":"","qualifiers":{"P1545":"2"}},{"value":"","qualifiers":{"P1545":"3"}}]}}