Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Reads0
Chats0
TLDR
The consecutive ones test for the consecutive ones property in matrices and for graph planarity is extended to a test for interval graphs using a recently discovered fast recognition algorithm for chordal graphs.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1976-12-01 and is currently open access. It has received 1622 citations till now. The article focuses on the topics: Indifference graph & Interval graph.read more
Citations
More filters
Journal ArticleDOI
The dynamics and regulators of cell fate decisions are revealed by pseudotemporal ordering of single cells
Cole Trapnell,Davide Cacchiarelli,Davide Cacchiarelli,Jonna Grimsby,Prapti Pokharel,Shuqiang Li,Michael A. Morse,Michael A. Morse,Niall J. Lennon,Kenneth J. Livak,Tarjei S. Mikkelsen,Tarjei S. Mikkelsen,John L. Rinn,John L. Rinn,John L. Rinn +14 more
TL;DR: Monocle is described, an unsupervised algorithm that increases the temporal resolution of transcriptome dynamics using single-cell RNA-Seq data collected at multiple time points that revealed switch-like changes in expression of key regulatory factors, sequential waves of gene regulation, and expression of regulators that were not known to act in differentiation.
Book
Constraint Processing
TL;DR: Rina Dechter synthesizes three decades of researchers work on constraint processing in AI, databases and programming languages, operations research, management science, and applied mathematics to provide the first comprehensive examination of the theory that underlies constraint processing algorithms.
Journal ArticleDOI
Complexity of finding embeddings in a k -tree
TL;DR: This work determines the complexity status of two problems related to finding the smallest number k such that a given graph is a partial k-tree and presents an algorithm with polynomially bounded (but exponential in k) worst case time complexity.
Book
The Algorithm Design Manual
TL;DR: This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency.
Journal ArticleDOI
Algorithms for drawing graphs: an annotated bibliography
TL;DR: A bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs is presented, a first attempt to encompass both theoretical and application-oriented papers from disparate areas.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal ArticleDOI
Gaussian elimination is not optimal
TL;DR: In this paper, Cook et al. gave an algorithm which computes the coefficients of the product of two square matrices A and B of order n with less than 4. 7 n l°g 7 arithmetical operations (all logarithms in this paper are for base 2).
Journal ArticleDOI
Incidence matrices and interval graphs
TL;DR: In this article, the problem of determining when a graph is an interval graph is a special case of the following problem concerning (0, 1)-matrices: when can the rows of such a matrix be permuted so as to make the 1's in each colum appear consecutively.
Journal ArticleDOI
Algorithmic Aspects of Vertex Elimination on Graphs
TL;DR: A graph-theoretic elimination process which is related to performing Gaussian elimination on sparse symmetric positive definite systems of linear equations is considered, and it is conjecture that the problem of finding a minimum ordering is NP-complete.
Journal ArticleDOI
Efficient Planarity Testing
TL;DR: An efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane is described, which used depth-first search and has time and space bounds.