File:Feedback arc set NP-completeness.svg
From Vigyanwiki
Size of this PNG preview of this SVG file: 512 × 512 pixels. Other resolutions: 240 × 240 pixels | 480 × 480 pixels | 768 × 768 pixels | 1,024 × 1,024 pixels | 2,048 × 2,048 pixels.
Original file (SVG file, nominally 512 × 512 pixels, file size: 3 KB)
Summary
| Description |
English: NP-completeness reduction from an instance of vertex cover (yellow graph) to the feedback arc set problem (blue graph). This is the original reduction of Karp and Lawler published by Karp in 1972; it expands each yellow graph vertex into two adjacent blue graph vertices, and each undirected yellow graph edge into directed edges in opposite directions. The red edges show a minimum feedback arc set, corresponding to a minimum vertex cover consisting of the upper left and lower right yellow vertices. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
I, the copyright holder of this work, hereby publish it under the following licence:
 
|
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighbouring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 04:58, 3 August 2021 | | 512 × 512 (3 KB) | wikimediacommons>David Eppstein | Uploaded own work with UploadWizard |
File usage
The following page uses this file:
