Enumerating perfect matchings in \(n\)-cubes (Q382880): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 6 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6232026 / rank
 
Normal rank
Property / zbMATH Keywords
 
perfect matching
Property / zbMATH Keywords: perfect matching / rank
 
Normal rank
Property / zbMATH Keywords
 
N-cube
Property / zbMATH Keywords: N-cube / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
enumeration
Property / zbMATH Keywords: enumeration / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: libexact / rank
 
Normal rank
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/s11083-012-9279-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012125988 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q60692021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are 526,915,620 nonisomorphic one‐factorizations of K<sub>12</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all the perfect matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of perfect matchings in a hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Hamiltonian cycles in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Latin squares of order 11 / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of<i>K</i><sub>14</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of Binary Constant Weight Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:55, 7 July 2024

scientific article
Language Label Description Also known as
English
Enumerating perfect matchings in \(n\)-cubes
scientific article

    Statements

    Identifiers