wiki_research

personal research wiki
git clone https://a3nm.net/git/wiki_research/
Log | Files | Refs

minimum_linear_arrangement (370B)

      1 # Minimum linear arrangement
      2 
      3 Given a [graph], find a [permutation] of the [vertices] such that the [sum] across [edges] of the difference between the permutation image of the two endpoint [vertices] is [minimized]
      4 
      5 The problem is [NP_complete]
      6 
      7 cf [bienkowski2024improved]
      8 
      9 Up: [computational_problem] on [graph]
     10 
     11 See also: [graph_layout], [maximum_linear_arrangement]