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

Stefan Arnborg, Andrzej Proskurowski

Source record

Source: Crossref

Published: Apr 1, 1989

DOI: 10.1016/0166-218x(89)90031-0

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.