Robert Kudelić
ABSTRACT
When Information System is developed a priority of subsystems development needs to be set. This problem is a more general problem than a well known problem Feedback Arc Set, and is like that problem also computationally hard to solve. Therefore in this paper we have found that real-world instances of Information System can be represented as a Flow Graph, and some of them do admit reducibility. This is significant since for such special cases polynomial and optimal solutions for the Information System Subsystems Development Order problem are achievable. This fact was until now unknown, and it broadens the body of knowledge behind the problem of Information System Subsystems Development Order, and other connected computationally hard problems. Such scientific contribution also gives insight into how to cope with Information System development in terms of a problem instance at hand.
- Frances E. Allen. 1970. Control flow analysis. ACM SIGPLAN Notices 5, 7 (jul 1970), 1--19. https://doi.org/10.1145/390013.808479 Google Scholar
Digital Library
- Jørgen Bang-Jensen and Gregory Z. Gutin. 2009. Digraphs. Springer London.Google ScholarDigital Library
- Norman L. Biggs. 1994. Algebraic Graph Theory. Cambridge University Press.Google Scholar
- John M. Boyer and Wendy J. Myrvold. 2004. On the Cutting Edge: Simplified O(n) Planarity by Edge Addition. Journal of Graph Algorithms and Applications 8, 3 (Oct. 2004), 241--273.Google ScholarCross Ref
- Danilo Bruschi, Lorenzo Martignoni, and Mattia Monga. 2006. Detecting Self-mutating Malware Using Control-Flow Graph Matching. In Detection of Intrusions and Malware & Vulnerability Assessment. Springer Berlin Heidelberg, 129--143. https://doi.org/10.1007/11790754_8 Google ScholarDigital Library
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms. MIT Press Ltd. Google ScholarDigital Library
- P. Crescenzi and V. Kann. 1997. Approximation on the web: A compendium of NP optimization problems. In Randomization and Approximation Techniques in Computer Science. Springer Berlin Heidelberg, 111--118. https://doi.org/10.1007/3-540-63248-4_10 Google ScholarDigital Library
- T. H. Davenport and J. E. Short.1990. The new industrial engineering: information technology and business process redesign. MIT Sloan Manage. Rev. 31, 4 (1990).Google Scholar
- Peter Eades, Xuemin Lin, and W.F. Smyth. 1993. A fast and effective heuristic for the feedback arc set problem. Inform. Process. Lett. 47, 6 (oct 1993), 319--323. https://doi.org/10.1016/0020-0190(93)90079-o Google ScholarDigital Library
- Michael Garey and David Johnson. 1979. Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Francisco. Google ScholarDigital Library
- Frank Harary. 1962. The Determinant of the Adjacency Matrix of a Graph. SIAM Rev. 4, 3 (jul 1962), 202--210. https://doi.org/10.1137/1004057Google ScholarDigital Library
- Matthew S. Hecht and Jeffrey D. Ullman. 1972. Flow graph reducibility. In Proceedings of the fourth annual ACM symposium on Theory of computing - STOC 72. ACM Press. https://doi.org/10.1145/800152.804919 Google ScholarDigital Library
- M. S. Hecht and J. D. Ullman. 1974. Characterizations of Reducible Flow Graphs. Journal of the ACM (JACM) 21, 3 (jul 1974), 367--375. https://doi.org/10.1145/321832.321835 Google ScholarDigital Library
- J. E. Hopcroft and J. D. Ullman. 1973. Set Merging Algorithms. SIAM J. Comput. 2, 4 (dec 1973), 294--303. https://doi.org/10.1137/0202024Google ScholarCross Ref
- Jørgen Jensen. 2001. Digraphs: theory, algorithms, and applications. Springer, London New York.Google Scholar
- A. B. Kahn. 1962. Topological sorting of large networks. Commun. ACM 5, 11 (nov 1962), 558--562. https://doi.org/10.1145/368996.369025 Google ScholarDigital Library
- Viggo Kann. 1992. On the approximability of NP-complete optimization problems. Royal Institute of Technology, Dept. of Numerical Analysis and Computing Science, Stockholm, Sweden.Google Scholar
- Richard M. Karp. 1972. Reducibility among Combinatorial Problems. In Complexity of Computer Computations. Springer US, 85--103. https://doi.org/10.1007/978-1-4684-2001-2_9Google Scholar
- Jens Krinke and Silvia Breu. 2004. Control-Flow-Graph-Based Aspect Mining. In In Workshop on Aspect Reverse Engineering.Google Scholar
- Robert Kudelić. 2016. Monte-Carlo randomized algorithm for minimal feedback arc set problem. Appl. Soft Comput. 41 (2016), 235--246. https://doi.org/10.1016/j.asoc.2015.12.018 Google ScholarDigital Library
- Robert Kudelić and Nikola Ivković. 2019. Ant inspired Monte Carlo algorithm for minimum feedback arc set. Expert Systems with Applications 122 (May 2019), 108--117. https://doi.org/10.1016/j.eswa.2018.12.021Google Scholar
- Robert Kudelić and Mario Konecki. 2017. On the Minimum Feedback Arc Set: Planarity of Information Systems Digraphs. In PROCEEDINGS OF The 11th MAC 2017. MAC Prague consulting s.r.o.Google Scholar
- Robert Kudelić and Alen Lovrenčić. 2016. More general minimum feedback arc set: Statistically defining information system digraph. In 2016 International Symposium ELMAR. IEEE. https://doi.org/10.1109/elmar.2016.7731755Google ScholarCross Ref
- Robert Kudelić, Dijana Oreški, and Mario Konecki. 2016. Monte-Carlo randomized algorithm: Empirical analysis on real-world information systems. In 2016 39th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). IEEE. https://doi.org/10.1109/mipro.2016.7522342Google ScholarCross Ref
- E. Lawler. 1964. A Comment on Minimum Feedback Arc Sets. IEEE Transactions on Circuit Theory 11, 2 (1964), 296--297. https://doi.org/10.1109/tct.1964.1082291Google ScholarCross Ref
- Vijaya Ramachandran. 1988. Finding a minimum feedback arc set in reducible flow graphs. Journal of Algorithms 9, 3 (sep 1988), 299--313. https://doi.org/10.1016/0196-6774(88)90022-3 Google ScholarDigital Library
- Robert Sedgewick. 2001. Algorithms in C++ Part 5. Pearson Education (US).Google Scholar
- Robert Sedgewick and Kevin Wayne. 2011. Algorithms. Addison Wesley. Google ScholarDigital Library
- Michael Simpson, Venkatesh Srinivasan, and Alex Thomo. 2016. Efficient computation of feedback arc set at web-scale. Proceedings of the VLDB Endowment 10, 3 (nov 2016), 133--144. https://doi.org/10.14778/3021924.3021930 Google ScholarDigital Library
- Steven S. Skiena. 2012. Sorting and Searching. In The Algorithm Design Manual. Springer London, 103--144. https://doi.org/10.1007/978-1-84800-070-4_4Google Scholar
- Xin Sun, Yibing Zhongyang, Zhi Xin, Bing Mao, and Li Xie. 2014. Detecting Code Reuse in Android Applications Using Component-Based Control Flow Graph. In ICT Systems Security and Privacy Protection. Springer Berlin Heidelberg, 142--155. https://doi.org/10.1007/978-3-642-55415-5_12Google Scholar
- Robert Tarjan. 1972. Depth-First Search and Linear Graph Algorithms. SIAM J. Comput. 1, 2 (jun 1972), 146--160. https://doi.org/10.1137/0201010Google ScholarDigital Library
- Robert Endre Tarjan. 1973. Testing flow graph reducibility. In STOC '73: Proceedings of the fifth annual ACM symposium on Theory of computing. ACM. https://doi.org/10.1145/800125.804040 Google ScholarDigital Library
- The Editors of Encyclopaedia Britannica. 2019. Flowchart. In Encyclopaedia Britannica. Encyclopædia Britannica, inc. https://www.britannica.com/topic/flowchartGoogle Scholar
- Neil Walkinshaw. 2013. Reverse-Engineering Software Behavior. In Advances in Computers. Elsevier, 1--58. https://doi.org/10.1016/b978-0-12-408089-8.00001-xGoogle Scholar
- D. Younger. 1963. Minimum Feedback Arc Sets for a Directed Graph. IEEE Transactions on Circuit Theory 10, 2 (1963), 238--245. https://doi.org/10.1109/tct.1963.1082116Google ScholarCross Ref
- Hai Zhou, Narendra Shenoy, and William Nicholls. 2001. Efficient minimum spanning tree construction without Delaunay triangulation. In Proceedings of the 2001 conference on Asia South Pacific design automation - ASP-DAC 01. ACM Press. https://doi.org/10.1145/370155.370320 Google ScholarDigital Library
Index Terms
- Dealing with Intractability of Information System Subsystems Development Order via Control Flow Graph Reducibility
Recommendations
Information Lower Bounds via Self-Reducibility
We use self-reduction methods to prove strong information lower bounds on two of the most studied functions in the communication complexity literature: Gap Hamming Distance (GHD) and Inner Product (IP). In our first result we affirm the conjecture that ...
Average-case intractability vs. worst-case intractability
We show that not all sets in NP (or other levels of the polynomial-time hierarchy) have efficient average-case algorithms unless the Arthur-Merlin classes MA and AM can be derandomized to NP and various subclasses of P/poly collapse to P. Furthermore, ...
Comments