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

Linear-time algorithms for NP-complete proble ...
Petra Scheffler, Petra Scheffl ...
Locate

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today


Buy this book

Last edited by Open Library Bot
December 4, 2010 | History

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

This edition doesn't have a description yet. Can you add one?

Buy this book

Edition Availability
Cover of: Linear-time algorithms for NP-complete problems restricted to partial k-trees
Linear-time algorithms for NP-complete problems restricted to partial k-trees
1987, Akademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik
in English

Add another edition?

Book Details


Edition Notes

Bibliography: p. 48.
Summary in English, German and Russian.

Published in
Berlin
Series
Report / Akademie der Wissenschaften der DDR, Karl-Weierstrass-Institut für Mathematik,, R-MATH-03/87, Report (Karl-Weierstrass-Institut für Mathematik) ;, R-Math-87/03.

Classifications

Library of Congress
QA267 .S34x 1987

The Physical Object

Pagination
48 p. ;
Number of pages
48

ID Numbers

Open Library
OL2105535M
LCCN
88156495

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
December 4, 2010 Edited by Open Library Bot Added subjects from MARC records.
December 10, 2009 Created by WorkBot add works page