Jump to content

Information for "Dinesman's multiple-dwelling problem"

Basic information

Display titleDinesman's multiple-dwelling problem
Default sort keyDinesman's multiple-dwelling problem
Page length (in bytes)202,377
Namespace ID0
Page ID7321
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Number of subpages of this page1 (0 redirects; 1 non-redirect)
Page views in the past month0

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorrosettacode>Paddy3118
Date of page creation08:23, 25 June 2011
Latest editorRichlove (talk | contribs)
Date of latest edit08:57, 27 November 2024
Total number of edits358
Recent number of edits (within past 180 days)47
Recent number of distinct authors6

Page properties

Hidden category (1)

This page is a member of a hidden category:

Transcluded templates (14)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
Task Solve Dinesman's multiple dwelling problem but in a way that most naturally follows the problem statement given below. Solutions are allowed (but not required...
Information from Extension:WikiSEO
Cookies help us deliver our services. By using our services, you agree to our use of cookies.