Counting Perfect Matchings and the Switch Chain (Q5232145): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127566627, #quickstatements; #temporary_batch_1722291251637
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1705.05790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure and stability number of \(P_{5}\)- and co-chair-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the permanent of graphs with large factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical problems involving permutations with restricted positions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Switch Markov Chain for Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes and the switch Markov chain for matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasimonotone graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_{5}\)-free augmenting graphs and the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval bigraphs and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing intersection classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting perfect matchings in general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs: A survey / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963972320 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127566627 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:05, 30 July 2024

scientific article; zbMATH DE number 7099868
Language Label Description Also known as
English
Counting Perfect Matchings and the Switch Chain
scientific article; zbMATH DE number 7099868

    Statements

    Counting Perfect Matchings and the Switch Chain (English)
    0 references
    0 references
    0 references
    0 references
    29 August 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    hereditary graph classes
    0 references
    matchings
    0 references
    approximate counting
    0 references
    Markov chains
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references