On the directed full degree spanning tree problem
type: Item
instance of: scholarly article
title: On the directed full degree spanning tree problem
zbMATH Open document ID: 1248.90074
author: Daniel Lokshtanov
author: Venkatesh Raman
author: Saket Saurabh
author: Somnath Sikdar
published in: Discrete Optimization
publication date: 2012-10-16T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6094036
zbMATH Keywords: parameterized complexity
zbMATH Keywords: kernelization
zbMATH Keywords: full degree spanning tree
MaRDI profile type: Publication
full work available at URL: j.disopt.2010.09.001
OpenAlex ID: W2072755080
cites work: Q4761320
cites work: Q4944739
cites work: On Local Search and Placement of Meters in Networks
cites work: Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual
cites work: A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
cites work: Spanning Directed Trees with Many Leaves
cites work: Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
cites work: FPT algorithms and kernels for the directed \(k\)-leaf problem
cites work: A Linear Vertex Kernel for Maximum Internal Spanning Tree
cites work: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
cites work: Minimum Leaf Out-Branching Problems
cites work: Q3369936
cites work: On Finding Directed Trees with Many Leaves
cites work: Introduction to algorithms
cites work: Q4393480
cites work: Parametrized complexity theory.
cites work: Q5710169
cites work: Treewidth. Computations and approximations
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: Easy problems for tree-decomposable graphs
DOI: 10.1016/J.DISOPT.2010.09.001
description: scientific article; zbMATH DE number 6094036