On counting 3-D matchings of size \(k\) (Q1040648): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jian'er Chen / rank
Normal rank
 
Property / author
 
Property / author: Jian'er Chen / 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/s00453-008-9207-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980552233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster parameterized algorithm for set packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte-Carlo approximation algorithms for enumeration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting in Sparse, Regular, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / 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 05:58, 2 July 2024

scientific article
Language Label Description Also known as
English
On counting 3-D matchings of size \(k\)
scientific article

    Statements

    On counting 3-D matchings of size \(k\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 November 2009
    0 references
    3-D matching
    0 references
    parameterized algorithm
    0 references
    approximation algorithm
    0 references
    randomized algorithm
    0 references
    counting complexity
    0 references

    Identifiers

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