Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-019-00614-4 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3046608358 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1707.01797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Kernelization Complexity of Colorful Motifs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel(s) for problems with no kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Longest Cycles in Graphs with Bounded Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The circumference of a graph with no \(K_{3,t}\)-minor. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum bisection is fixed parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the excluded minor structure theorem for graphs of large tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear connectivity forces large complete bipartite minors: an alternative approach / 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: Parameterized certificate dispersal and its variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for long induced paths in 3-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A completeness theory for polynomial (Turing) kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Highly Connected Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing kernelization for finding long paths and cycles in restricted graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5275384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVII: Taming a vortex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized computational complexity of finding small-diameter subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Turing-kernel for weighted independent set in bull-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524326 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127411783 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-019-00614-4 / rank
 
Normal rank

Latest revision as of 18:38, 17 December 2024

scientific article
Language Label Description Also known as
English
Turing kernelization for finding long paths in graph classes excluding a topological minor
scientific article

    Statements

    Turing kernelization for finding long paths in graph classes excluding a topological minor (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 September 2019
    0 references
    Turing kernelization
    0 references
    \(k\)-path
    0 references
    graph minors decomposition
    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