| 000 | 02869nam a22005415i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-10515-9 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125050.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 221010s2022 sz | s |||| 0|eng d | ||
| 020 |
_a9783031105159 _9978-3-031-10515-9 |
||
| 024 | 7 |
_a10.1007/978-3-031-10515-9 _2doi |
|
| 050 | 4 | _aQA9.58 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a005.13 _223 |
| 100 | 1 |
_aKudelić, Robert. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
| 245 | 1 | 0 |
_aFeedback Arc Set _h[electronic resource] : _bA History of the Problem and Algorithms / _cby Robert Kudelić. |
| 250 | _a1st ed. 2022. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2022. |
|
| 300 |
_aXI, 126 p. 1 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aSpringerBriefs in Computer Science, _x2191-5776 |
|
| 505 | 0 | _aPart 1. Overview of Findings -- Chapter 1. Feedback Arc Set -- Part 2. Feedback Arc Set and Algorithms Thereof -- Chapter 2. Introductory Remarks -- Chapter 3. Papers and Algorithms -- Part 3. Complexity Informed -- Chapter 4. Having the Right Tool. | |
| 520 | _aThe main aim of the book is to give a review of all relevant information regarding a well-known and important problem of Feedback Arc Set (FAS). This review naturally also includes a history of the problem, as well as specific algorithms. To this point such a work does not exist: There are sources where one can find incomplete and perhaps untrustworthy information. With this book, information about FAS can be found easily in one place: formulation, description, theoretical background, applications, algorithms etc. Such a compendium will be of help to people involved in research, but also to people that want to quickly acquaint themselves with the problem and need reliable information. Thus research, professional work and learning can proceed in a more streamlined and faster way. | ||
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aGraph theory. | |
| 650 | 0 |
_aComputers _xHistory. |
|
| 650 | 1 | 4 | _aDesign and Analysis of Algorithms. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aGraph Theory. |
| 650 | 2 | 4 | _aHistory of Computing. |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031105142 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031105166 |
| 830 | 0 |
_aSpringerBriefs in Computer Science, _x2191-5776 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-10515-9 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 942 | _cSPRINGER | ||
| 999 |
_c173836 _d173836 |
||