Linear time algorithms for NP-hard problems restricted to partial k- trees

From MaRDI portal

DOI10.1016/0166-218X(89)90031-0zbMATH Open0666.68067WikidataQ56141684 ScholiaQ56141684MaRDI QIDQ1116705FDOQ1116705


Authors: Stefan Arnborg, Andrzej Proskurowski Edit this on Wikidata


Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)





Recommendations




Cites Work


Cited In (only showing first 100 items - show all)





This page was built for publication: Linear time algorithms for NP-hard problems restricted to partial k- trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1116705)