NDLI: Linear algorithms to recognize interval graphs and test for the consecutive ones property

Please wait, while we are loading the content...

Complexity measures and hierarchies for the evaluation of integers, polynomials, and n-linear forms

A generalization and proof of the Aanderaa-Rosenberg conjecture

The complexity of parallel evaluation of linear recurrence

On computing the minima of quadratic forms (Preliminary Report)

A 2.5 n-lower bound on the combinational complexity of Boolean functions

Lower bounds on the size of Boolean formulas: Preliminary Report

On non-linear lower bounds in computational complexity

On the complexity of grammar and related problems

A combinatorial problem which is complete in polynomial space

On the validity and complexity of bounded resolution

Feasibly constructive proofs and the propositional calculus (Preliminary Version)

Computability concepts for programming language semantics

Proving assertions about programs that manipulate data structures

On (un)predictability of formal languages (Extended Abstract)

On decomposing languages defined by parallel devices

Intercalation theorems for tree transducer languages

On the (combinatorial) structure of L languages without interactions (Extended Abstract)

Degree-languages, polynomial time recognition, and the LBA problem

Comparative complexity of grammar forms

Hashing schemes for extendible arrays (Extended Abstract)

Four models for the analysis and optimization of program control structures

Node listings for reducible flow graphs

The complexity of control structures and data structures

The optimal fixedpoint of recursive programs

Optimal code generation for expression trees

On the complexity of the Extended String-to-String Correction Problem

Geometric complexity

Riemann's Hypothesis and tests for primality

Two applications of a probabilistic search technique: Sorting X+Y and building balanced search trees

Algorithmic aspects of vertex elimination

Linear algorithms to recognize interval graphs and test for the consecutive ones property

Content Provider	ACM Digital Library
Author	Booth, Kellogg S. Lueker, George S.
Abstract	A matrix of zeroes and ones is said to have the consecutive ones property if there is a permutation of its rows such that the ones in each column appear consecutively. This paper develops a data structure which may be used to test a matrix for the consecutive ones property, and produce the desired permutation of the rows, in linear time. One application of the consecutive ones property is in recognizing interval graphs. A graph is an interval graph if there exists a 1-1 correspondence between its vertices and a set of intervals on the real line such that two vertices are adjacent if and only if the corresponding intervals have a nonempty intersection. Fulkerson and Gross have characterized interval graphs as those for which the clique versus vertex incidence matrix has the consecutive ones property. In testing this particular matrix for the consecutive ones property we may process the columns in a special order to simplify the algorithm. This yields the interval graph recognition algorithm which is presented in section 2; section 3 indicates how this algorithm may be extended to the general consecutive ones problem.
Starting Page	255
Ending Page	265
Page Count	11
File Format	PDF
DOI	10.1145/800116.803776
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1975-05-05
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

New techniques for selecting test frequencies for linear analog circuits

Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs

Linear-Time Recognition of Probe Interval Graphs

Matrices with the consecutive ones property, interval graphs and their applications

Minimizing Test Frequencies for Linear Analog Circuits: New Models and Efficient Solution Methods

A simple test for the consecutive ones property (1992)

A Spectral Algorithm for Seriation and the Consecutive Ones Problem

Efficient minimization of test frequencies for linear analog circuits

Improved efficient parallel algorithms to recognize interval graphs and interval hypergraphs

Linear algorithms to recognize interval graphs and test for the consecutive ones property

Similar Documents

New techniques for selecting test frequencies for linear analog circuits

Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs

Linear-Time Recognition of Probe Interval Graphs

Matrices with the consecutive ones property, interval graphs and their applications

Minimizing Test Frequencies for Linear Analog Circuits: New Models and Efficient Solution Methods

A simple test for the consecutive ones property (1992)

A Spectral Algorithm for Seriation and the Consecutive Ones Problem

Efficient minimization of test frequencies for linear analog circuits

Improved efficient parallel algorithms to recognize interval graphs and interval hypergraphs

Linear algorithms to recognize interval graphs and test for the consecutive ones property