Uniquely pressable graphs: characterization, enumeration, and recognition (Q1755655): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q547864
Created claim: Wikidata QID (P12): Q129030674, #quickstatements; #temporary_batch_1723945101418
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Joshua N. Cooper / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963709356 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1706.07468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of matrix reduction over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting by Transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast matrix decomposition in \(\mathbb F_2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving the pressing game conjecture on linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting linear extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \((18/11)n\) upper bound for sorting by prefix reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On average and highest number of flips in pancake sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Successful pressing sequences for a bicolored graph and binary matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average number of reversals needed to sort signed permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3393448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for sorting by prefix reversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distribution of cycles in breakpoint graphs of signed permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-approximation algorithm for genome rearrangements by reversals and transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming cabbage into turnip / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the graph isomorphism counting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3629755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129030674 / rank
 
Normal rank

Latest revision as of 03:43, 18 August 2024

scientific article
Language Label Description Also known as
English
Uniquely pressable graphs: characterization, enumeration, and recognition
scientific article

    Statements

    Uniquely pressable graphs: characterization, enumeration, and recognition (English)
    0 references
    0 references
    0 references
    10 January 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    pressing sequence
    0 references
    adjacency matrix
    0 references
    Cholesky factorization
    0 references
    binary matrix
    0 references
    phylogenetics
    0 references
    genome reversals
    0 references
    graph theory
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references