Bonsma, Paul; Paulusma, Daniël: Using contracted solution graphs for solving reconfiguration problems. (English summary) Acta Inform. 56 (2019), no. 7-8, 619-648.

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Bonsma, Paul; Paulusma, Daniël: Using contracted solution graphs for solving reconfiguration problems. (English summary) Acta Inform. 56 (2019), no. 7-8, 619-648.
Authors:	ID Dallard, Clément Jean (Author)
Files:	http://www.ams.org/mathscinet
Language:	English
Work type:	Unknown
Typology:	1.19 - Review, Book Review, Critique
Organization:	IAM - Andrej Marušič Institute
Keywords:	reconfiguration, dynamic programming, graph coloring
Year of publishing:	2021
Number of pages:	MR4017641
PID:	20.500.12556/RUP-17046
UDC:	519.17
ISSN on article:	2167-5163
COBISS.SI-ID:	82167555
Publication date in RUP:	26.10.2021
Views:	2311
Downloads:	10
Metadata:
:	DALLARD, Clément Jean, 2021, Bonsma, Paul; Paulusma, Daniël: Using contracted solution graphs for solving reconfiguration problems. (English summary) Acta Inform. 56 (2019), no. 7-8, 619-648. MathSciNet [online]. 2021. [Accessed 24 April 2025]. Retrieved from: http://www.ams.org/mathscinet Copy citation

Average score:	0.5 1 1.5 2 2.5 3 3.5 4 4.5 5 (0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Searching for similar works... Please wait....

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Title:	MathSciNet
Publisher:	American Mathematical Society
ISSN:	2167-5163
COBISS.SI-ID:	50093825

Language:	English
Keywords:	rekonfiguracija, dinamično programiranje, barvanje grafov

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back