An exact algorithm for the maximum leaf spanning tree problem (Q653320): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59442095, #quickstatements; #temporary_batch_1707216511891
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.1016/j.tcs.2011.07.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2180968341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Time Minor Tests with Depth-First Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT algorithms and kernels for the directed \(k\)-leaf problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Maximum Leaf Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving connected dominating set faster than \(2^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler and better approximation algorithms for network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Finding Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual algorithms for connected facility location problems / rank
 
Normal rank

Latest revision as of 20:13, 4 July 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for the maximum leaf spanning tree problem
scientific article

    Statements

    An exact algorithm for the maximum leaf spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    exponential time algorithms
    0 references
    graph algorithms
    0 references
    spanning tree
    0 references
    maximum leaf spanning tree
    0 references
    0 references
    0 references