On the complexity landscape of connected \(f\)-factor problems (Q2414869): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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-019-00546-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2546840917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of regular subgraph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3915022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected graph factors of minimum weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rural postman parameterized by the number of components of required edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the tree-packing theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected factors in graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Exact Algorithms for Special Cases of Connected f-Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Exponential Algorithms for Connected f-Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors and factorization: 1985--2003: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank

Latest revision as of 08:05, 19 July 2024

scientific article
Language Label Description Also known as
English
On the complexity landscape of connected \(f\)-factor problems
scientific article

    Statements

    On the complexity landscape of connected \(f\)-factor problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 May 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    connected \(f\)-factors
    0 references
    quasi-polynomial time algorithms
    0 references
    randomized algorithms
    0 references
    NP-intermediate
    0 references
    exponential time hypothesis
    0 references
    0 references