Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (Q690497): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: File organization / 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: Q3840361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new planarity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the consecutive ones property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Complete Consecutive Information Retrieval Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consecutive block minimization is 1.5-approximable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms to enumerate all common intervals of two permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient text fingerprinting via Parikh mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the Number of Hamilton Cycles in Random Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximately Counting Hamilton Paths and Cycles in Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Cycles in Random Regular Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating and Counting Hamilton Cycles in Random Regular Graphs / rank
 
Normal rank

Latest revision as of 22:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings
scientific article

    Statements

    Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (English)
    0 references
    0 references
    0 references
    0 references
    27 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    sequences with repeated symbols
    0 references
    multisets
    0 references
    consecutive ones property
    0 references
    counting permutations
    0 references
    PQ-trees
    0 references
    complexity
    0 references
    0 references