scientific article; zbMATH DE number 6469219
From MaRDI portal
Publication:5501338
zbMath1318.68189MaRDI QIDQ5501338
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Data structures (68P05)
Related Items (18)
On a Verification Framework for Certifying Distributed Algorithms: Distributed Checking and Consistency ⋮ Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs ⋮ Iterated local search for consecutive block minimization ⋮ A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs ⋮ Proper Helly Circular-Arc Graphs ⋮ A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix ⋮ Certifying algorithms ⋮ A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row ⋮ 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 ⋮ Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results ⋮ Consecutive Ones Property Testing: Cut or Swap ⋮ Phylogenetic graph models beyond trees ⋮ Linear-Time Recognition of Probe Interval Graphs ⋮ Obtaining matrices with the consecutive ones property by row deletions
This page was built for publication:
