Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves
type: Item
instance of: scholarly article
title: Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves
DOI: 10.1007/978-3-031-43587-4_28
author: Emmanuel Sam
author: Benjamin Bergougnoux
author: Petr A. Golovach
author: Nello Blaser
publication date: 2024-05-29T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7856033
zbMATH Keywords: DFS tree
zbMATH Keywords: spanning tree
zbMATH Keywords: kernelization
zbMATH Keywords: parameterized complexity
MaRDI profile type: Publication
cites work: The DFS-heuristic for orthogonal graph drawing
cites work: Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
cites work: Mathematical Foundations of Computer Science 2003
cites work: Spanning trees with pairwise nonadjacent endvertices
cites work: Complexity of independency and cliquy trees
cites work: Q3651735
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Parameterized Algorithms
cites work: Trémaux Trees and Planarity
cites work: Trémaux trees and planarity
cites work: Graph Theory
cites work: Fundamentals of parameterized complexity
cites work: Q3570028
cites work: On finding optimal and near-optimal lineal spanning trees
cites work: On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
cites work: A Linear Vertex Kernel for Maximum Internal Spanning Tree
cites work: Efficient Planarity Testing
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
cites work: Q4472448
cites work: Algorithms and Data Structures
cites work: Complexities of some interesting problems on spanning trees
cites work: On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
description: scientific article; zbMATH DE number 7856033