litlas
Log inCreate account

Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms

Authors: Kellogg S. Booth, George S. Lueker - Journal of Computer and System Sciences 1976 cited by 1,498

ON THE TOPOLOGY OF THEGENETIC FINE STRUCTUREON THE TOPOLOGY OF THE GENETIC FINE STRUCTUREOn rigid circuit graphsOn rigid circuit graphsRepresentation of afinite graph by a set o…Representation of a finite graph by a set of intervals on the real lineA CHARACTERIZATION OFCOMPARABILITY GRAPHS AN…A CHARACTERIZATION OF COMPARABILITY GRAPHS AND OF INTERVAL GRAPHSIncidence matrices andinterval graphsIncidence matrices and interval graphsTriangulated graphs andthe elimination processTriangulated graphs and the elimination processMatrix characterizationsof circular-arc graphsMatrix characterizations of circular-arc graphsA structure theorem forthe consecutive 1's…A structure theorem for the consecutive 1's propertyEfficient PlanarityTestingEfficient Planarity TestingThe Design and Analysisof Computer AlgorithmsThe Design and Analysis of Computer AlgorithmsAlgorithmic Aspects ofVertex Elimination on…Algorithmic Aspects of Vertex Elimination on GraphsComputing an st-NumberingComputing an st -NumberingLinear Time AutomorphismAlgorithms for Trees…Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar GraphsFinding HamiltonianCircuits in Interval…Finding Hamiltonian Circuits in Interval GraphsRectilinear PlanarLayouts and Bipolar…Rectilinear Planar Layouts and Bipolar Orientations of Planar GraphsA Simple Linear -TImeAlgorithm to Recognize…A Simple Linear -TIme Algorithm to Recognize Interval GraphsMapping the genome: somecombinatorial problems…Mapping the genome: some combinatorial problems arising in molecular biologyAn O(n2 algorithm forcircular-arc graph…An O(n2 algorithm for circular-arc graph recognitionPlanarity for ClusteredGraphsPlanarity for Clustered GraphsSimple Linear TimeRecognition of Unit…Simple Linear Time Recognition of Unit Interval GraphsRecognition ofRobinsonian…Recognition of Robinsonian dissimilaritiesFast and SimpleAlgorithms for…Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval GraphsTractability ofParameterized Completio…Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval GraphsCertifying Algorithmsfor Recognizing Interva…Certifying Algorithms for Recognizing Interval Graphs and Permutation GraphsTesting for theConsecutive Ones…Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree AlgorithmsEarlier referencesFocus paperCiting papersOlderNewer

Click a node to pin it, click the empty canvas to go back to this paper, or hover to preview. Open a node’s page from its title.