Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430): 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-0166-3 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6714294 / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized algorithm
Property / zbMATH Keywords: parameterized algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-internal out-branching
Property / zbMATH Keywords: \(k\)-internal out-branching / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-tree
Property / zbMATH Keywords: \(k\)-tree / rank
 
Normal rank
Property / zbMATH Keywords
 
multilinear detection
Property / zbMATH Keywords: multilinear detection / rank
 
Normal rank
Property / zbMATH Keywords
 
proper coloring
Property / zbMATH Keywords: proper coloring / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-016-0166-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2406276733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrow sieves for parameterized paths and packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spotting Trees with Few Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear vertex kernel for maximum internal spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp separation and applications to exact and parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representative Sets of Product Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum leaf out-branching and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits and Applications of Group Algebras for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2k-vertex Kernel for Maximum Internal Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3369936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4756732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representative Families: A Unified Tradeoff-Based Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Delta \)-list vertex coloring in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for k-Internal Out-Branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing Color Coding-Related Techniques / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-016-0166-3 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:29, 9 December 2024

scientific article
Language Label Description Also known as
English
Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
scientific article

    Statements

    Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (English)
    0 references
    0 references
    0 references
    11 May 2017
    0 references
    parameterized algorithm
    0 references
    \(k\)-internal out-branching
    0 references
    \(k\)-tree
    0 references
    multilinear detection
    0 references
    proper coloring
    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