The Experts below are selected from a list of 1244598 Experts worldwide ranked by ideXlab platform
Srinivas Aluru - One of the best experts on this subject based on the ideXlab platform.
-
space efficient Linear Time construction of suffix arrays
Journal of Discrete Algorithms, 2005Co-Authors: Srinivas AluruAbstract:Abstract We present a Linear Time algorithm to sort all the suffixes of a string over a large alphabet of integers. The sorted order of suffixes of a string is also called suffix array, a data structure introduced by Manber and Myers that has numerous applications in pattern matching, string processing, and computational biology. Though the suffix tree of a string can be constructed in Linear Time and the sorted order of suffixes derived from it, a direct algorithm for suffix sorting is of great interest due to the space requirements of suffix trees. Our result is one of the first Linear Time suffix array construction algorithms, which improve upon the previously known O ( n log n ) Time direct algorithms for suffix sorting. It can also be used to derive a different Linear Time construction algorithm for suffix trees. Apart from being simple and applicable for alphabets not necessarily of fixed size, this method of constructing suffix trees is more space efficient.
-
space efficient Linear Time construction of suffix arrays
Combinatorial Pattern Matching, 2003Co-Authors: Srinivas AluruAbstract:We present a Linear Time algorithm to sort all the suffixes of a string over a large alphabet of integers. The sorted order of suffixes of a string is also called suffix array, a data structure introduced by Manber and Myers that has numerous applications in pattern matching, string processing, and computational biology. Though the suffix tree of a string can be constructed in Linear Time and the sorted order of suffixes derived from it, a direct algorithm for suffix sorting is of great interest due to the space requirements of suffix trees. Our result improves upon the best known direct algorithm for suffix sorting, which takes O(n log n) Time. We also show how to construct suffix trees in Linear Time from our suffix sorting result. Apart from being simple and applicable for alphabets not necessarily of fixed size, this method of constructing suffix trees is more space efficient.
Yahav Nussbaum - One of the best experts on this subject based on the ideXlab platform.
-
A Simpler Linear-Time Recognition of Circular-Arc Graphs
Algorithmica, 2010Co-Authors: Haim Kaplan, Yahav NussbaumAbstract:We give a Linear-Time recognition algorithm for circular-arc graphs based on the algorithm of Eschen and Spinrad (Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 128–137, 1993) and Eschen (PhD thesis, 1997). Our algorithm both improves the Time bound of Eschen and Spinrad, and fixes some flaws in it. Our algorithm is simpler than the earlier Linear-Time recognition algorithm of McConnell (Algorithmica 37(2):93–147, 2003), which is the only Linear Time recognition algorithm previously known.
-
A simpler Linear-Time recognition of circular-arc graphs
Lecture Notes in Computer Science, 2006Co-Authors: Haim Kaplan, Yahav NussbaumAbstract:We give a Linear Time recognition algorithm for circular-arc graphs. Our algorithm is much simpler than the Linear Time recognition algorithm of McConnell [10] (which is the only Linear Time recognition algorithm previously known). Our algorithm is a new and careful implementation of the algorithm of Eschen and Spinrad [4,5]. We also tighten the analysis of Eschen and Spinrad.
-
SWAT - A simpler Linear-Time recognition of circular-arc graphs
Algorithm Theory – SWAT 2006, 2006Co-Authors: Haim Kaplan, Yahav NussbaumAbstract:We give a Linear Time recognition algorithm for circular-arc graphs. Our algorithm is much simpler than the Linear Time recognition algorithm of McConnell [10] (which is the only Linear Time recognition algorithm previously known). Our algorithm is a new and careful implementation of the algorithm of Eschen and Spinrad [4, 5]. We also tighten the analysis of Eschen and Spinrad
David Mcallester - One of the best experts on this subject based on the ideXlab platform.
-
PLDI - Linear-Time subtransitive control flow analysis
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation - PLDI '97, 1997Co-Authors: Nevin Heintze, David McallesterAbstract:We present a Linear-Time algorithm for bounded-type programs that builds a directed graph whose transitive closure gives exactly the results of the standard (cubic-Time) Control-Flow Analysis (CFA) algorithm. Our algorithm can be used to list all functions calls from all call sites in (optimal) quadratic Time. More importantly, it can be used to give Linear-Time algorithms for CFA-consuming applications such as:b effects analysis: find the side-effecting expressions in a program.b k-limited CFA: for each call-site, list the functions if there are only a few of them (l k) and otherwise output "many".b called-once analysis: identify all functions called from only one call-site.
Christophe Paul - One of the best experts on this subject based on the ideXlab platform.
-
A Simple Linear-Time Modular Decomposition Algorithm
2016Co-Authors: Michel Habib, Fabien De Montgolfier, Christophe PaulAbstract:The first polynomial Time algorithm (O(n)) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in Linear-Time algorithms [22, 7, 23, 9]. Although having optimal Time complexity these algorithms are quite complicated and difficult to implement. In this paper we present an easily implementable Linear-Time algorithm for modular decomposition. This algorithm uses the notion of factorizing permutation and a new data-structure, the Ordered Chain Partitions.
-
Simple, Linear-Time modular decomposition
arXiv: Discrete Mathematics, 2007Co-Authors: Marc Tedder, Derek G. Corneil, Michel Habib, Christophe PaulAbstract:Modular decomposition is fundamental for many important problems in algorithmic graph theory including transitive orientation, the recognition of several classes of graphs, and certain combinatorial optimization problems. Accordingly, there has been a drive towards a practical, Linear-Time algorithm for the problem. Despite considerable effort, such an algorithm has remained elusive. The Linear-Time algorithms to date are impractical and of mainly theoretical interest. In this paper we present the first simple, Linear-Time algorithm to compute the modular decomposition tree of an undirected graph. The breakthrough comes by combining the best elements of two different approaches to the problem.
-
Simple, Linear-Time Modular Decomposition
2007Co-Authors: Marc Tedder, Derek G. Corneil, Michel Habib, Christophe PaulAbstract:Modular decomposition is fundamental for many important problems in algorithmic graph-theory including transitive orientation, the recognition of several classes of graphs, and certain combinatorial optimization problems. Accordingly, there has been a drive towards a practical, Linear-Time algorithm for the problem. Despite considerable effort, such an algorithm has remained elusive. The Linear-Time algorithms to date are impractical and of mainly theoretical interest. In this paper we present the first simple, Linear-Time algorithm to compute the modular decomposition tree of an undirected graph.
-
A Simple Linear Time Algorithm for Cograph Recognition
Discrete Applied Mathematics, 2005Co-Authors: Michel Habib, Christophe PaulAbstract:A Simple Linear Time Algorithm for Cograph Recognition
Haim Kaplan - One of the best experts on this subject based on the ideXlab platform.
-
A Simpler Linear-Time Recognition of Circular-Arc Graphs
Algorithmica, 2010Co-Authors: Haim Kaplan, Yahav NussbaumAbstract:We give a Linear-Time recognition algorithm for circular-arc graphs based on the algorithm of Eschen and Spinrad (Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 128–137, 1993) and Eschen (PhD thesis, 1997). Our algorithm both improves the Time bound of Eschen and Spinrad, and fixes some flaws in it. Our algorithm is simpler than the earlier Linear-Time recognition algorithm of McConnell (Algorithmica 37(2):93–147, 2003), which is the only Linear Time recognition algorithm previously known.
-
A simpler Linear-Time recognition of circular-arc graphs
Lecture Notes in Computer Science, 2006Co-Authors: Haim Kaplan, Yahav NussbaumAbstract:We give a Linear Time recognition algorithm for circular-arc graphs. Our algorithm is much simpler than the Linear Time recognition algorithm of McConnell [10] (which is the only Linear Time recognition algorithm previously known). Our algorithm is a new and careful implementation of the algorithm of Eschen and Spinrad [4,5]. We also tighten the analysis of Eschen and Spinrad.
-
SWAT - A simpler Linear-Time recognition of circular-arc graphs
Algorithm Theory – SWAT 2006, 2006Co-Authors: Haim Kaplan, Yahav NussbaumAbstract:We give a Linear Time recognition algorithm for circular-arc graphs. Our algorithm is much simpler than the Linear Time recognition algorithm of McConnell [10] (which is the only Linear Time recognition algorithm previously known). Our algorithm is a new and careful implementation of the algorithm of Eschen and Spinrad [4, 5]. We also tighten the analysis of Eschen and Spinrad
