A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (Q3007640): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/978-3-642-20712-9_29 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101954823 / 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: A Faster Algorithm for Finding Minimum Tucker Submatrices / 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: Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction / 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: Q4507228 / 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: 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: On the consecutive ones property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of matrices with the consecutive ones property / 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: Disjoint paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure theorem for the consecutive 1's property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Capacity Scheduling—I / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:50, 4 July 2024

scientific article
Language Label Description Also known as
English
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row
scientific article

    Statements

    A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2011
    0 references
    0 references
    0 references
    0 references

    Identifiers