Graph classes and the switch Markov chain for matchings (Q5963358): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q59896270, #quickstatements; #temporary_batch_1721940658196
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1752753627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems / 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: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / 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: Approximate counting by dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation and search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random walk on the rook placements on a Ferrers board / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / 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: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphs without asteroidal triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Lexical Orderings of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimizing width in linear layouts / 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: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonredundant 1’s in $\Gamma $-Free Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / 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: Q4737226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59896270 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:08, 25 July 2024

scientific article; zbMATH DE number 6542897
Language Label Description Also known as
English
Graph classes and the switch Markov chain for matchings
scientific article; zbMATH DE number 6542897

    Statements

    Graph classes and the switch Markov chain for matchings (English)
    0 references
    0 references
    0 references
    19 February 2016
    0 references
    switch Markov chain
    0 references
    graphs
    0 references
    matchings
    0 references
    0 references
    0 references
    0 references

    Identifiers

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