A faster algorithm for finding minimum Tucker submatrices (Q693064): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-012-9388-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030520663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Physical Mapping and the consecutive ones property for sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Algorithm for Seriation and the Consecutive Ones Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Scheduling via Integer Programs with Circular Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of testing for odd holes and induced odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Finding Minimum Tucker Submatrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Gapped Consecutive-Ones Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties and decomposition of linear balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3397627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and fixed-parameter algorithms for consecutive ones submatrix problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the consecutive ones submatrix problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for hitting objects with straight lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Test for the Consecutive Ones Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: PC trees and circular-ones arrangements. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Complete Consecutive Information Retrieval Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Station Location - Complexity and Approximation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the consecutive ones property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simultaneous consecutive ones problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering with almost consecutive ones property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The consecutive ones submatrix problem for sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Capacity Scheduling—I / rank
 
Normal rank

Latest revision as of 22:54, 5 July 2024

scientific article
Language Label Description Also known as
English
A faster algorithm for finding minimum Tucker submatrices
scientific article

    Statements

    A faster algorithm for finding minimum Tucker submatrices (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2012
    0 references
    consecutive ones property
    0 references
    Tucker configurations
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references