Publication:5501338
From MaRDI portal
zbMath1318.68189MaRDI QIDQ5501338
Publication date: 3 August 2015
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
68P05: Data structures
Related Items
Linear-Time Recognition of Probe Interval Graphs, On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency, A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix, Certifying algorithms, On counting interval lengths of interval graphs, A faster algorithm for finding minimum Tucker submatrices, Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs, Approximation and fixed-parameter algorithms for consecutive ones submatrix problems, A note on computing set overlap classes, Phylogenetic graph models beyond trees, Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results, Obtaining matrices with the consecutive ones property by row deletions, Iterated local search for consecutive block minimization, A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs, A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row, Consecutive Ones Property Testing: Cut or Swap, Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs, Proper Helly Circular-Arc Graphs
