Covering Vectors by Spaces: Regular Matroids (Q4555045): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128945340, #quickstatements; #temporary_batch_1723616886801
 
(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: 1710.02300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms to Preserve Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Secretary for Regular and Decomposable Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Circuits in Regular Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First Order Properties of Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Rota's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The highly connected matroids in minor-closed classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width, parse trees, and monadic second-order logic for matroids. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive algorithm for path-width of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Enumeration Problems for Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition width of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with local restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphic matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of computing the minimum distance of a code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPT algorithm for edge subset feedback edge set / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2900588169 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128945340 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:49, 14 August 2024

scientific article; zbMATH DE number 6981148
Language Label Description Also known as
English
Covering Vectors by Spaces: Regular Matroids
scientific article; zbMATH DE number 6981148

    Statements

    Covering Vectors by Spaces: Regular Matroids (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 November 2018
    0 references
    regular matroids
    0 references
    spanning set
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers