This is the Trace Id: 3f3b80c46877f2a95b303af2ecc63059
Skip to main content Microsoft 365 Office Azure Copilot Windows Support Windows Apps OneDrive Outlook Moving from Skype to Teams OneNote Microsoft Teams Accessories Xbox games Microsoft AI Microsoft Security Azure Dynamics 365 Microsoft 365 for business Microsoft Power Platform Windows 365 Digital Sovereignty Microsoft Developer Microsoft Learn Support for AI marketplace apps Microsoft Tech Community Microsoft Marketplace Visual Studio Marketplace Rewards Free downloads & security Education Gift cards View Sitemap

Exposition of the Rubber Band Method

This code is a nonstandard combination of an expository article, an algorithm animation, and a research tool. Last published: April 22, 2004.

Important! Selecting a language below will dynamically change the complete page content to that language.

Download
  • Version:

    1.1

    Date Published:

    15/05/2024

    File Name:

    Tutte.zip

    File Size:

    286.8 KB

    This code is a nonstandard combination of an expository article, an algorithm animation, and a research tool. It describes the common idea behind algorithms solving three basic graph theory problems, planarity, connectivity, and maximum cut. The reader can experiment by creating his/her own graphs, or modifying those from a library, to see the behavior of these algorithms.
  • Supported Operating Systems

    Windows 10, Windows 7, Windows 8

    • Windows 7, Windows 8, or Windows 10
    • Click Download and follow the instructions.