
Overview
- Includes everything important about FAS in one place, methodologically organized and from a reliable source
- A FAS work that is both extensive and in-depth, covering aspects from theory to practice
- An unparalelled compendium of FAS algorithms, including important information from works that produced them
Part of the book series: SpringerBriefs in Computer Science (BRIEFSCOMPUTER)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
The 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.
Similar content being viewed by others
Keywords
Table of contents (4 chapters)
-
Overview of Findings
-
Feedback Arc Set and Algorithms Thereof
-
Complexity Informed
Authors and Affiliations
About the author
Bibliographic Information
Book Title: Feedback Arc Set
Book Subtitle: A History of the Problem and Algorithms
Authors: Robert Kudelić
Series Title: SpringerBriefs in Computer Science
DOI: https://doi.org/10.1007/978-3-031-10515-9
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Author(s), under exclusive license to Springer Nature Switzerland AG 2022
Softcover ISBN: 978-3-031-10514-2Published: 11 October 2022
eBook ISBN: 978-3-031-10515-9Published: 10 October 2022
Series ISSN: 2191-5768
Series E-ISSN: 2191-5776
Edition Number: 1
Number of Pages: XI, 126
Number of Illustrations: 1 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Algorithms, Graph Theory, History of Computing