Fixed-parameter tractable distances to sparse graph classes (Q2408199): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-016-0235-7 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q59613680 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2099200602 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1502.05910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly regular graphs, partial geometries and partially balanced designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Model Theory on Tame Classes of Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism preservation on quasi-wide classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability, Definability, and Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding first-order properties of locally tree-decomposable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Using Structural Parameters on Sparse Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing to a graph of given degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing to a Connected Graph of Given Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized coloring problems on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph editing problems with extended regularity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing graphs to satisfy degree constraints: a parameterized approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed-parameter tractability of parameterized model-checking problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-016-0235-7 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:08, 18 December 2024

scientific article
Language Label Description Also known as
English
Fixed-parameter tractable distances to sparse graph classes
scientific article

    Statements

    Fixed-parameter tractable distances to sparse graph classes (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    fixed-parameter tractable
    0 references
    parameterized complexity
    0 references
    graph theory
    0 references
    sparse graphs
    0 references
    nowhere dense
    0 references
    excluded minor
    0 references
    minor-closed
    0 references
    deletion distance
    0 references
    elimination distance
    0 references
    distance
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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